Cryptanalysis of MD5 Compress (1996) [8 citations — 0 self]
http://www.securitytechnet.com/crypto/algorithm/..
http://www.cs.ru.ac.za/courses/Honours/mmcourse/se
http://www.epm.ornl.gov/~dunigan/md5crack.ps
CACHED:
Abstract:
the recent analysis of MD4-like hash functions. 1 Using the term "collision of a compress function" we assume that the initial value is the same for both inputs, i.e. an initial value IV and two different inputs X and ~ X are given such that compress(IV ; X) = compress(IV ; ~ X): On the other hand we use the term "pseudo-collision" if two different initial values IV; ~ IV and (possibly identical) inputs X; ~ X are given such that compress(IV ; X) = compress( ~ IV ; ~ X): Pseudo-collisions are of much less practical importance than collisions. Collision for the compress function of MD5. Use the following initial value
Citations
| 287 | The MD5 Message Digest Algorithm – Rivest - 1992 |
| 47 | Secure hash standard – FIPS - 1995 |
| 42 | Collisions for the compression function of MD5 – Boer, Bosselaers - 1994 |
| 21 | RIPEMD-160: A Strengthened Version – Dobbertin, Bosselaers, et al. - 1996 |
| 19 | RIPEMD with two-round compress function is not collision-free – Dobbertin - 1997 |
| 11 | Cryptanalysis of MD4,” Fast Software Encryption – DOBBERTIN - 1996 |
| 1 | Ripe Integrity Primitives -- Final report – Consortium - 1995 |
| 1 | On pseudo-collisions in MD5, Technical Report TR-102, version 1.1, RSA Laboratories – Robshaw - 1994 |
| 1 | On pseudo-collisions in MD5 – Robshaw - 1994 |

