Presentation 2003/7/10
Analysis of Double Block Length Hash Functions
Mitsuhiro HATTORI, Shoichi HIROSE, Susumu YOSHIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The security of double block length hash functions and their compression functions is analyzed in this paper. First, the analysis of double block length hash functions by Satoh, Haga, and Kurosawa are investigated. The focus of this investigation is their analysis of the double block length hash functions with the rate 1 whose compression functions consist of a block cipher with the key twice longer than the plaintext/ciphertext. lt is shown that there exists a case uncovered by their analysis. Second, the compression functions are analyzed with which secure double block length hash functions may be constructed. The analysis shows that these comoression functions are at most as secure as the compression functions of single block length hash functions.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Hash functions / block ciphers / cryptanalysis / double block length hash functions
Paper # ISEC2003-14
Date of Issue

Conference Information
Committee ISEC
Conference Date 2003/7/10(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) Analysis of Double Block Length Hash Functions
Sub Title (in English)
Keyword(1) Hash functions
Keyword(2) block ciphers
Keyword(3) cryptanalysis
Keyword(4) double block length hash functions
1st Author's Name Mitsuhiro HATTORI
1st Author's Affiliation Graduate School of Informatics, Kyoto University()
2nd Author's Name Shoichi HIROSE
2nd Author's Affiliation Graduate School of Informatics, Kyoto University
3rd Author's Name Susumu YOSHIDA
3rd Author's Affiliation Graduate School of Informatics, Kyoto University
Date 2003/7/10
Paper # ISEC2003-14
Volume (vol) vol.103
Number (no) 195
Page pp.pp.-
#Pages 7
Date of Issue