Presentation 2007-09-07
How To Find Many Collisions of 3-Pass HAVAL
Kazuhiro SUZUKI, Kaoru KUROSAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The hash function HAVAL is a well known Merkle-Damgard hash function such as MD4 and MD5. It has three variants, 3-, 4- and 5-pass HAVAL. On 3-pass HAVAL, the best known attack finds a collision pair with 2^7 computations of the compression function. To find k collision pairs, it requires 2^7k computations. In this paper, we present a better collision attack on 3-pass HAVAL, which can find k collision pairs with only 2k+33 computations. Further, our message differential is different from the previous ones. It is important to find collisions for different message differentials.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) hash function / HAVAL / collision / differential attack
Paper # ISEC2007-79
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/8/31(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language ENG
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) How To Find Many Collisions of 3-Pass HAVAL
Sub Title (in English)
Keyword(1) hash function
Keyword(2) HAVAL
Keyword(3) collision
Keyword(4) differential attack
1st Author's Name Kazuhiro SUZUKI
1st Author's Affiliation Venture Business Laboratory, Ibaraki University()
2nd Author's Name Kaoru KUROSAWA
2nd Author's Affiliation Department of Computer and Information Sciences, Ibaraki University
Date 2007-09-07
Paper # ISEC2007-79
Volume (vol) vol.107
Number (no) 209
Page pp.pp.-
#Pages 8
Date of Issue