Presentation 1995/11/16
0n sufficient conditions for secure iterated one way hash functions
Shouichi HIROSE, Katsuo IKEDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) In this report, we discuss sufficient conditions for collision-free iterated hash functions. First, it is shown that a kind of iterated hash functions based on block ciphers are not necessarily collision-free even if the block ciphers are secure against the chosen plaintext attack. This result is applicable to many of the proposed schemes, such as Rabin scheme, Davies-Meyer scheme and so on. Second, we investigate the relationship between two input sequences which are transformed to the same sequence by iterated hash functions and show sufficient conditions on round functions for iterated hash functions to be collision-free.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Hash functions / iterated hash functions / block ciphers / collision-free
Paper # ISEC95-24
Date of Issue

Conference Information
Committee ISEC
Conference Date 1995/11/16(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 JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) 0n sufficient conditions for secure iterated one way hash functions
Sub Title (in English)
Keyword(1) Hash functions
Keyword(2) iterated hash functions
Keyword(3) block ciphers
Keyword(4) collision-free
1st Author's Name Shouichi HIROSE
1st Author's Affiliation Division of Information Science, Graduate School of Engineering, Kyoto University()
2nd Author's Name Katsuo IKEDA
2nd Author's Affiliation Division of Information Science, Graduate School of Engineering, Kyoto University
Date 1995/11/16
Paper # ISEC95-24
Volume (vol) vol.95
Number (no) 353
Page pp.pp.-
#Pages 8
Date of Issue