Abstract
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.
This work was supported by the Concerted Research Action (GOA) Mefisto-2000/06 of the Flemish Government.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Biham, E., Shamir, A.: Differential Cryptanalysis of the Data Encryption Standard. Springer, Heidelberg (1993)
Calyptix Security, HAVAL source code (reference implementation), available at: http://www.calyptix.com/downloads.html
Dobbertin, H.: Cryptanalysis of MD4. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 53–69. Springer, Heidelberg (1996)
Dobbertin, H.: The status of MD5 after a recent attack. Cryptobytes 2(2), 1–6 (Summer 1996)
Dobbertin, H., Bosselaers, A., Preneel, B.: RIPEMD-160: A strengthened version of RIPEMD. In: Gollmann, D. (ed.) FSE 1996. LNCS, vol. 1039, pp. 71–82. Springer, Heidelberg (1996)
Her, Y.-S., Sakurai, K., Kim, S.-H.: Attacks for finding collision in reduced versions of 3-pass and 4-pass HAVAL. In: Proceedings International Conference on Computers, Communications and Systems (ICCCS 2003), CE-15, pp. 75–78 (2003)
Kasselman, P., Penzhorn, W.: Cryptanalysis of reduced version of HAVAL. Electronics Letters 36(1), 30–31 (2000)
National Institute of Standards and Technology, FIPS-180-2: Secure Hash Standard (SHS) (August 2002)
Park, S., Sung, S.H., Chee, S., Lim, J.: On the security of reduced versions of 3-pass HAVAL. In: Batten, L.M., Seberry, J. (eds.) ACISP 2002. LNCS, vol. 2384, pp. 406–419. Springer, Heidelberg (2002)
Rivest, R.L.: The MD4 message-digest algorithm. In: Menezes, A., Vanstone, S.A. (eds.) CRYPTO 1990. LNCS, vol. 537, pp. 303–311. Springer, Heidelberg (1991)
Rivest, R.L.: The MD5 message-digest algorithm, Request for Comments (RFC) 1321, Internet Activities Board, Internet Privacy Task Force (April 1992)
Zheng, Y., Pieprzyk, J., Seberry, J.: HAVAL – a one-way hashing algorithm with variable length of output. In: Zheng, Y., Seberry, J. (eds.) AUSCRYPT 1992. LNCS, vol. 718, pp. 83–104. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Van Rompay, B., Biryukov, A., Preneel, B., Vandewalle, J. (2003). Cryptanalysis of 3-Pass HAVAL. In: Laih, CS. (eds) Advances in Cryptology - ASIACRYPT 2003. ASIACRYPT 2003. Lecture Notes in Computer Science, vol 2894. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-40061-5_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-40061-5_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20592-0
Online ISBN: 978-3-540-40061-5
eBook Packages: Springer Book Archive