english only
School of Computer and Communication Sciences
LASEC - Security and Cryptography Laboratory
EPFL > IC > LASEC > Projects
Banner IC
INDEX
Home
People
Research
Teaching
Publications
Softwares & Events
Intranet
How to reach us

CONTACT

EPFL - I&C - ISC - LASEC
Station 14 - Building INF
CH-1015 Lausanne
Switzerland

Tel. +41 21 693 7603
Fax. +41 21 693 7689

Job application or support letter request:
please read our policy.

Collisions on MD4
 
Author: Arnaud Burlet
 
Supervisor: Pascal Junod


 
Date: Winter Semester 2002-2003
 
Abstract: In 1990 Rivest introduced the hash function MD4. MD4 is a three round compression function. Some attacks against one or two of the three rounds of MD4 were published, but none of them could be generalized to the full MD4. In 1998, Dobbertin published an attack against all the three rounds of MD4. His article called "Cryptanalysis of MD4" and published in the "Journal of Cryptology" is the base of our work.

We made an implementation of the described attack. We had to make some basic changes to his algorithm to find collisions for MD4. In general, finding a collision requires between 10 and 30 seconds on a standard PC.

In our work, we briefly explained Dobbertin's algorithm, and we exposed the difference between his algorithm and our implementation.