An improved collision attack on MD5 algorithm

3Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The research on the attack algorithm for a MD5 collision is one of the focuses in cryptology nowadays. In this paper, by analyzing the properties of the nonlinear Boolean functions used in MD5 and the differences in term of XOR and subtraction modulo 2 32, we prove that some sufficient conditions presented by Jie Liang and Xuejia Lai are also necessary to guarantee the differential path and give a set of necessary and sufficient conditions to guarantee the output differences of the last two steps. Then we present an improved collision attack algorithm on MD5 by using the set of necessary and sufficient conditions. Finally, we analyze the computational complexity of our attack algorithm which is 0.718692 times of that of the previous collision attack algorithms. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chen, S., & Jin, C. (2008). An improved collision attack on MD5 algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4990 LNCS, pp. 343–357). https://doi.org/10.1007/978-3-540-79499-8_27

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free