Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Preimage Attacks on One-Block MD4, 63-Step MD5 and More
verfasst von : Kazumaro Aoki, Yu Sasaki
Erschienen in: Selected Areas in Cryptography
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
This paper shows preimage attacks on one-block MD4 and MD5 reduced to 63 (out of 64) steps. Our attacks are based on the meet-in-the-middle attack, and many additional improvements make the preimage computable faster than that of the brute-force attack, 2
128
hash computation. A preimage of one-block MD4 can be computed in the complexity of the 2
107
MD4 compression function computation, and a preimage of MD5 reduced to 63 steps can be computed in the complexity of the 2
121
MD5 compression function computation. Moreover, we optimize the computational order of the brute-force attack against MD5, and a preimage of full-round MD5 can be computed in the complexity of the 2
127
MD5 compression function computation.