MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

How to break MD5 and other hash functions (2005) [81 citations — 2 self]

by Xiaoyun Wang ,  Hongbo Yu
In EUROCRYPT
Add To MetaCart

Abstract:

Abstract. MD5 is one of the most widely used cryptographic hash functions nowadays. It was designed in 1992 as an improvement of MD4, and its security was widely studied since then by several authors. The best known result so far was a semi free-start collision, in which the initial value of the hash function is replaced by a non-standard value, which is the result of the attack. In this paper we present a new powerful attack on MD5 which allows us to find collisions efficiently. We used this attack to find collisions of MD5 in about 15 minutes up to an hour computation time. The attack is a differential attack, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure. We call this kind of differential a modular differential. An application of this attack to MD4 can find a collision in less than a fraction of a second. This attack is also applicable to other hash functions, such as RIPEMD and HAVAL. 1

Citations

287 The MD5 Message Digest Algorithm – Rivest - 1992
266 Differential Cryptanalysis of the Data Encryption Standard – Biham, Shamir - 1993
166 A Design Principle for Hash Functions – Damg˚ard - 1990
81 The MD5 message-digest algorithm. Request for Comments: 1321 – Rivest - 1992
55 The Status of MD5 After a Recent Attack – Dobbertin - 1996
47 Secure hash standard – FIPS - 1995
35 Near-Collisions of SHA-0 – Biham, Chen - 2004
32 One way hash functions and – Merkle - 1989
23 RIPEMD-160, a strengthened version – Dobbertin, Bosselaers, et al. - 1996
20 RIPEMD with Two-Round Compress Function is Not Collision – Dobbertin - 1997
18 Cryptanalysis of MD5 Compress. Presented at the rump session of Eurocrypt ’96 – Dobbertin - 1996
12 Integrity Primitives for Secure Information Systems – RIPE - 1995
12 HAVAL-A One-way Hashing Algorithm with Variable Length of Output – Zheng, Pieprzyk, et al. - 1993
5 Collisions for SHA-0. Rump session of Crypto’04 – Joux - 2004
2 Collisions for the Compression Function – Boer - 1994