## CryptoDB

### Paper: Cryptanalysis of 4-Pass HAVAL

Authors: Zhangyi Wang Huanguo Zhang Zhongping Qin Qingshu Meng URL: http://eprint.iacr.org/2006/161 Search ePrint Search Google HAVAL is a cryptographic hash function proposed by Zheng et al. Rompay et al and Wang et al found collisions of full 3-Pass HAVAL. In this paper, we study the security of 4-Pass HAVAL. We find collisions of full versions of 4-Pass HAVAL. The attack is similar to the two-block attack of MD5 proposed by Wang et al. The computational complexity of the attack is about 2^30-2^32 for the first block and 2^27-2^29 for the second block. We use this attack to find 256bit collisions of 4-Pass HAVAL in 3-4 hour on a common PC.
##### BibTeX
@misc{eprint-2006-21654,
title={Cryptanalysis of 4-Pass HAVAL},
booktitle={IACR Eprint archive},
keywords={hash , collision, differential attack},
url={http://eprint.iacr.org/2006/161},
note={ wzy@whu.edu.cn 13380 received 28 Apr 2006, last revised 20 Aug 2006},
author={Zhangyi Wang and Huanguo Zhang and Zhongping Qin and Qingshu Meng},
year=2006
}