APA Format, double space, 12 pt font, and Time New Roman
2/3 pages
Hashing is a one-way function that maps a message to a fixed-size sequence of bits (hashed value) with the assumption it is extremely difficult to reverse the process. Given the hashed-value, it is practically impossible to compute the original message given the hashed-value. It is extremely rare that two messages hash to the same value. When this happens, we refer to the event as a “collision”. In this paper, you are going to discuss why are collisions bad to message integrity. Also discuss the chances of collisions with the algorithm Message Digest 5 (MD5).
Analysis | 0 – 40 points | 41 – 90 |
Demonstrates a lack of understanding of Hashing Functions | Demonstrates an understanding of Hashing Functions | |
Writing Quality & Adherence to Format Guidelines | 0-6 points | 9-10 points |
Paper shows a below average/poor writing style lacking in elements of appropriate standard English and following proper APA guidelines. | Paper is well written and clear using APA guidelines and standard English characterized by elements of a strong writing style. |
