Larry B. de Guzman
ABSTRACT
Over the past two decades, significant researches have been done in analyzing the MD5 algorithm to address its collision problem. This paper enhanced the original MD5 by adding four logical operations to increase the security of the message to become free from collision attack. To test the enhanced algorithm, different data with collision problems using the MD5 Collision generator were used. The avalanche effect was measured, and the result provided more than 50%-bit change. The enhanced MD5 was also tested against dictionary attack using online cracking tools and these tools failed to crack and revert the message digest into plain text. Overall, the enhanced algorithm mitigated the collision problem of MD5.
- L. R. Knudsen, & F. Muller (2005). Some attacks against a double length hash proposal. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3788 LNCS, 462--473. Google Scholar
Digital Library
- R. Rivest (1992). The MD5 Message-Digest Algorithm, 1--21. SAS Institute Inc. (2005). Concepts of experimental design. Biostatistics for Animal ..., 34. Retrieved from http://www.cabdirect.org/abstracts/20083014785.html Google ScholarDigital Library
- H. Gilbert, Frederic Muller, M. R. (n.d.) 2016. Combining Compression Fucntion and Block Cipher-Based hash fucntions. ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security Pages 315--331 Google ScholarDigital Library
- Stevens, M. (2012). Attacks on Hash Functions and Applications. Retrieved from http://marc-stevens.nl/research/papers/PhD Thesis Marc Stevens - Attacks on Hash Functions and Applications.pdfGoogle Scholar
- Den Boer, B., & Bosselaers, A. (1994). Collisions for the compression function of {MD5}. Advances in Cryptology --- {EUROCRYPT} '93, 293--304.Google Scholar
- Kashyap, N. (2006). A Meaningful MD5 Hash Collision Attack. Retrieved from http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.126.2659&rep=rep1&type=pdfGoogle ScholarCross Ref
- Hans Dobbertin (1996)Advances in Cryptology, p. 298--312, August 18-22, 1996Google Scholar
- Wang, X., Feng, D., Lai, X., & Yu, H. (2004). Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD. IACR Cryptology ePrint Archive, 5(October), 5--8. Retrieved from http://web.mit.edu/fustflum/documents/crypto.pdfGoogle Scholar
- Klima, V. (2006). Tunnels in Hash Functions: MD5 Collisions Within a Minute, 17. Retrieved from http://eprint.iacr.org/2006/105.pdfGoogle Scholar
- Stevens, M., Sotirov, A., Appelbaum, J., Lenstra, A. K., Molnar, D., Osvik, D. A., & de Weger, B. (2009). Short Chosen-Prefix Collisions for {MD5} and the Creation of a Rogue {CA} Certificate. Advances in Cryptology-CRYPTO 2009, 55--69. Google ScholarDigital Library
- Sasaki, Y., & Aoki, K. (2009). Finding preimages in full MD5 faster than exhaustive search. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 5479 LNCS, 134--152.Google Scholar
- Nan, B. X., & Xiang, D. H. (2010). The mixed encryption algorithm based on MD5 and XOR transformation. Proceedings of the 2010 Second International Workshop on Education Technology and Computer Science (ETCS)Google ScholarCross Ref
- Jacob, N. M. (2016). International Journal of Science and Engineering Vulnerability of data security using MD5 function in php database design, 1(1), 11--15.Google Scholar
- Zheng, X., & Jin, J. (2012). Research for the application and safety of MD5 algorithm in password authentication. Proceedings of the 2012 9th International Conference on Fuzzy Systems and Knowledge Discovery (FSKD)Google ScholarCross Ref
- Chawdhury, D. A., & Habib, A. H. M. A. (2008). Security Enhancement of MD5 Hashed Passwords by Using the Unused Bits of TCP Header, 5(Iccit), 25--27.Google Scholar
- Mwangi Joseph, T. W. D. W. C. (2014). Enhanced Message Digest Version 5 Architecture for Secure Hashing\n. IOSR Journal of Computer Engineering (IOSR-JCE), 16(5), 125--129. Retrieved from http://www.iosrjournals.org/iosr-jce/papers/Vol16-issue5/Version-7/Q1657125129.pdfGoogle ScholarCross Ref
- Mandal and Tiwari (2012). Analysis of Avalanche effect in Plaintext of DES USING Binary Codes International Journal of merging trends & Technology in Computer Science Volume 1, Issue 3, September-October 2012Google Scholar
Index Terms
- MD5 Secured Cryptographic Hash Value
Recommendations
Improved collision attack on hash function MD5
In this paper, we present a fast attack algorithm to find two-block collision of hash function MD5. The algorithm is based on the two-block collision differential path of MD5 that was presented by Wang et al. in the Conference EUROCRYPT 2005. We found ...
Collisions of MMO-MD5 and their impact on original MD5
AFRICACRYPT'11: Proceedings of the 4th international conference on Progress in cryptology in AfricaIn this paper, we find collisions of MD5 in the Matyas-Meyer-Oseas mode and Miyaguchi-Preneel mode with a complexity of 239 operations, which runs contrary to the cryptographer's belief that these modes are stronger against collision attacks than the ...
Cryptanalysis of the tiger hash function
ASIACRYPT'07: Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information securityTiger is a cryptographic hash function with a 192-bit hash value. It was proposed by Anderson and Biham in 1996. Recently, weaknesses have been shown in round-reduced variants of the Tiger hash function. First, at FSE 2006, Kelsey and Lucks presented a ...
Comments