Presentation	2010-03-05 Preimage Resistance of Hash Functions on the Dedicated Block Cipher Hidenori KUWAKADO, Shoichi HIROSE,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	The security of hash functions has been discussed under the assumption of ideal primitives such as an ideal cipher and a random oracle. Such security proofs imply that the hash functions cannot be broken without examining a structure of the primitive. The security proof based on practical primitives is more significant, but there are few results under practical primitives. This paper discusses the preimage resistance of hash functions that are the modification of Lesamnta-LW under a practical model. We show that the hash functions are preimage resistant if an underlying blockcipher is a psuedorandom permutation and the equivalent-key rate of the blockcipher is close to 1.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)
Paper #	IT2009-115,ISEC2009-123,WBS2009-94
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2010/2/25(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)	Preimage Resistance of Hash Functions on the Dedicated Block Cipher
Sub Title (in English)
Keyword(1)
1st Author's Name	Hidenori KUWAKADO
1st Author's Affiliation	Graduate School of Engineering, Kobe University()
2nd Author's Name	Shoichi HIROSE
2nd Author's Affiliation	Graduate School of Engineering, University of Fukui
Date	2010-03-05
Paper #	IT2009-115,ISEC2009-123,WBS2009-94
Volume (vol)	vol.109
Number (no)	445
Page	pp.pp.-
#Pages	5
Date of Issue