Presentation 1998/12/12
Towards Secure and Fast Hash Functions
Takashi SATOH, Mio HAGA, Kaoru KUROSAWA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We analyze the security of iterated 2m-bit output hash functions with rate 1 whose round function uses a m-bit block cipher with a 2m-bit key. We first show a preimage attack with O (2^m) complexity on Yi and Lam's hash function of this type. Next, it si shown that a very wide class of such functions is less secure than MDC-2. More precisely, we prove that there exist a preimage attack and a 2nd preimage attack with O (2^m) complexity and a collision attack with O (2^<3m/4> complexity, respectively. Finally, we suggest a class of double block length hash functions which seem to be as secure as MDC-2.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) hash functions / block ciphers / cryptanalysis / meet-in-the middle attack
Paper # ISEC98-67
Date of Issue

Conference Information
Committee ISEC
Conference Date 1998/12/12(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) Towards Secure and Fast Hash Functions
Sub Title (in English)
Keyword(1) hash functions
Keyword(2) block ciphers
Keyword(3) cryptanalysis
Keyword(4) meet-in-the middle attack
1st Author's Name Takashi SATOH
1st Author's Affiliation Faculty of Engineering, Tokyo Institute of Technology()
2nd Author's Name Mio HAGA
2nd Author's Affiliation Faculty of Engineering, Tokyo Institute of Technology
3rd Author's Name Kaoru KUROSAWA
3rd Author's Affiliation Faculty of Engineering, Tokyo Institute of Technology
Date 1998/12/12
Paper # ISEC98-67
Volume (vol) vol.98
Number (no) 466
Page pp.pp.-
#Pages 11
Date of Issue