Hashing Algorithms, Research Paper Example

One of the frequently utilized algorithms is the MD5 algorithm. It stands for Message-Digest algorithm 5. It is a 128-bit hash value cryptographic function. An MD 5 algorithm is mostly in the form of a 32-digit hexadecimal number. The MD5 has been favored because it is impossible to get two messages that are different with the same hash. It is also impossible to change a note without altering the hash. When using the algorithm it is also impossible to find a dispatch that uses a specific hash. Lastly, the hash value of any message is stress-free to figure. The drawbacks of using MD5 are that: MD5 rainbow tables have been published online by individuals for which can be used to crack passwords, the MD5 hash function is compromised hence severely insecure.

The Secure Hashing Algorithm is another commonly used algorithm. There are three generations in use, the most recent being the SHA512. It uses 64-bit words and has 80 rounds. It is faster than its predecessor SHA256. SHA512 is advantageous because computation of the hash figure for whichever dispatch is straightforward no message can have a specific hash value, altering a dispatch without altering its hash value is impossible. Different messages cannot have the same hash value, and finally, SHA512 collision ratio is lesser than that for MD. One disadvantage is that hackers have produced collision pairs for SHA-0, which produces fewer SHA-1 collisions.

Another hash algorithm is the SWIFFT algorithm. It is a collection of verified hash functions based on the Fast Fourier Transform concept. It is a 512-bit hash algorithm. SWIFFT provides a reduction in security in the least favorable case of a difficult mathematical problem. This makes it one of the most secure hash functions. It is also extremely fast compared to other functions. It is, however, disadvantageous since it is not an all-purpose algorithm. It is not a pseudorandom algorithm.

References

Bellare, M., & Kohno. T. (2004) Hash function balance and its impact on birthday attacks.

Advances in Cryptology – EUROCRYPT , Vol. 3027. Retrieved from: http://www.springer.com/computer/security+and+cryptology

Lyubashevsky, V., Micciancio1, D., Peikert, C., and Rosen, A. (2008) SWIFFT: A Modest Proposal for FFT Hashing. ScienceStage. Retrieved from: http://sciencestage.com/d/1267193/swifft-a-modest-proposal-for-fft-hashing