Cryptanalysis of the full HAVAL with 4 and 5 passes

Hongbo Yu, Xiaoyun Wang, Aaram Yun, Sangwoo Park

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

21 Scopus citations


HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992, It has three variants, 3-, 4-, and 5-pass HAVAL, Previous results on HAVAL suggested only practical collision attacks for 3-pass HAVAL, In this paper, we present collision attacks for 4 and 5 pass HAVAL, For 4-pass HAVAL, we describe two practical attacks for finding 2-block collisions, one with 243 computations and the other with 236 computations. In addition, we show that collisions for 5-pass HAVAL can be found with about 2123 computations, which is the first attack more efficient than the birthday attack.

Original languageEnglish
Title of host publicationFast Software Encryption - 13th International Workshop, FSE 2006, Revised Selected Papers
PublisherSpringer Verlag
Number of pages22
ISBN (Print)3540365974, 9783540365976
StatePublished - 2006
Event13th International Workshop on Fast Software Encryption, FSE 2006 - Graz, Austria
Duration: 15 Mar 200617 Mar 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4047 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference13th International Workshop on Fast Software Encryption, FSE 2006


  • Collision
  • Differential path
  • Hash function
  • Message modification


Dive into the research topics of 'Cryptanalysis of the full HAVAL with 4 and 5 passes'. Together they form a unique fingerprint.

Cite this