Difference between revisions of "HAVAL"

Revision as of 20:58, 10 March 2008

digest size: 128,160,192,224,256 bits
max. message length: < 2⁶⁴ bits
compression function: 1024-bit message block, 3/4/5 passes with 256-bit chaining variable
Specification:

Yuliang Zheng, Josef Pieprzyk, Jennifer Seberry - HAVAL - A One-Way Hashing Algorithm with Variable Length of Output

ASIACRYPT 718:83-104,1993

Author : Yuliang Zheng, Josef Pieprzyk, Jennifer Seberry
Title : HAVAL - A One-Way Hashing Algorithm with Variable Length of Output
In : ASIACRYPT -
Address :
Date : 1993

Hongbo Yu, Xiaoyun Wang, Aaram Yun, Sangwoo Park - Cryptanalysis of the Full HAVAL with 4 and 5 Passes

4047:89-110,2006

Author : Hongbo Yu, Xiaoyun Wang, Aaram Yun, Sangwoo Park
Title : Cryptanalysis of the Full HAVAL with 4 and 5 Passes
In : -
Address :
Date : 2006

Bart Van Rompay, Alex Biryukov, Bart Preneel, Joos Vandewalle - Cryptanalysis of 3-Pass HAVAL

ASIACRYPT 2894:228-245,2003

Author : Bart Van Rompay, Alex Biryukov, Bart Preneel, Joos Vandewalle
Title : Cryptanalysis of 3-Pass HAVAL
In : ASIACRYPT -
Address :
Date : 2003

@@ Line 37: / Line 37: @@
 === Collision Attacks ===
+<bibtex>
+@inproceedings{fseYuWYP06,
+  owner     = {tnad},
+  author    = {Hongbo Yu and Xiaoyun Wang and Aaram Yun and Sangwoo Park},
+  title     = {Cryptanalysis of the Full HAVAL with 4 and 5 Passes},
+  pages     = {89-110},
+  publisher = {Springer},
+  series    = {LNCS},
+  volume    = {4047},
+  year      = {2006},
+  isbn      = {3-540-36597-4},
+  url        = {http://dx.doi.org/10.1007/11799313_7},
+  abstract  = {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 2<sup>43</sup> computations
+and the other with 2<sup>36</sup> computations. In addition, we show that collisions for 5-pass HAVAL
+can be found with about 2<sup>123</sup> computations, which is the first attack more efficient than
+the birthday attack. Keywords: Hash function, collision, differential path, message modification. }
+}
+</bibtex>
 <bibtex>
 @inproceedings{asiacryptRompayBPV03,