Cryptanalysis of 3-Pass HAVAL

HAVAL is a cryptographic hash function proposed in 1992 by Zheng, Pieprzyk and Seberry. Its has a structure that is quite similar to other well-known hash functions such as MD4 and MD5. The specification of HAVAL includes a security parameter: the number of passes (that is, the number of times that a particular word of the message is used in the computation) can be chosen equal to 3, 4 or 5. In this paper we describe a practical attack that finds collisions for the 3-pass version of HAVAL. This means that it is possible to generate pairs of messages hashing to the same value. The computational complexity of the attack corresponds to about 229 computations of the compression function of 3-pass HAVAL; the required amount of memory is negligible.

• Type: Conference
• Year: 2003
• Where: ASIACRYPT
• Authors: Bart Van Rompay, Alex Biryukov, Bart Preneel, Joos Vandewalle
• Keywords: ASIACRYPT 2003, Cryptographic Hash Function, Cryptology, Hash Functions, HAVAL