Abstract
Md5 [1] has been widely used because of its irreversibility, but its security is also questionable. Since Professor Wang [2] pointed out that MD5 is unsafe, Md5 collision and various attack algorithms began to appear and were used in large quantities. In the paper of Bai Honghuan’s MD5 fast collision algorithm [3], the characteristics of MD5 collision were proposed, he pointed out that when the MD5 values of two different files are the same, the files are added with the same prefix, and their MD5 values are still the same. Similarly, when the same suffix is added, MD5 values is still the same, and a program is tested to verify the result.
This paper first studies the principle of MD5 algorithm [4], then points out the process of MD5 collision through Fastcoll tool, and experiments on a simple C language program using Bai Honghuan’s method to verify that the program can be collided by MD5. So the method of double encryption or multiple encryption for this phenomenon, it is equivalent to adding two locks or more locks to the data. The data is first encrypted by sha-256 to obtain a hash value, and then Md5 encryption is performed on the hash value. This method does not change the fact that MD5 can be collided and attacked, but in this case it will increase the difficulty of generating two different programs with the same MD5 value through the MD5 prefix attack. In the current situation, the possibility of SHA-256 being cracked is small. When the MD5 value (SHA-256 of the modified program) is collided, but if program is changed, the SHA-256 value is also modified, finally the MD5 value will be different. According to this conclusion, if data is complex encrypted multiple times by SHA-256 and MD5, it will be more difficult to crack.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Rivest, R.L.: The MD5 Message Digest Algorithm, Request for Comments (RFC)1321, Internet Activities Board, Internet PrivacZ Task Force, April 1992.3RIPEMD-1281
Wang, X., Yu, H.: How to break MD5 and other hash functions. Springer, Heidelberg (2005)
Bai, H.: The study of quick Md5 collision algorithms, 7 July 2010
Stevens, M.: On collisions for md5. Master’s thesis, Eindhoven University of Technology, June 2007
Yang, Y., Chen, Y., Chen, Y., et al.: A novel universal steganalysis algorithm based on the IQM and the SRM. CMC Comput. Mater. Continua 56(2), 261–272 (2018)
Tang, Z., Ling, M., Yao, H., et al.: Robust image hashing via random Gabor filtering and DWT. Comput. Mater. Continua 55(2), 331–344 (2018)
Gao, Z., Xia, S., Zhang, Y., et al.: Real-time visual tracking with compact shape and color feature. Comput. Mater. Continua 55(3), 509–521 (2018)
Acknowledgement
This research was funded in part by the National Natural Science Foundation of China (61871140, 61872100, 61572153, U1636215), the National Key research and Development Plan (Grant No. 2018YFB0803504).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Li, Y., HeLu, X., Li, M., Sun, Y., Wang, L. (2019). Implementation of MD5 Collision Attack in Program. In: Sun, X., Pan, Z., Bertino, E. (eds) Artificial Intelligence and Security. ICAIS 2019. Lecture Notes in Computer Science(), vol 11632. Springer, Cham. https://doi.org/10.1007/978-3-030-24274-9_54
Download citation
DOI: https://doi.org/10.1007/978-3-030-24274-9_54
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-24273-2
Online ISBN: 978-3-030-24274-9
eBook Packages: Computer ScienceComputer Science (R0)