Presentation	2004-07-20 Secure Double Block Length Hash Functions Based on Abreast/Tandem Davies-Meyer Shoichi HIROSE,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	It is an open question whether there exists an efficient double-block-length hash function such that time complexity of any collision-finding algorithm against it is Ω(2^), where l is the length of the output. In this article, a partial but affirmative answer is given to this question in a black-box model. The answer is partial because it is assumed that two different block ciphers are used in the hash functions for the security proofs.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	abreast Davies-Meyer / tandem Davies-Meyer / double-block-length hash function / black-box model / block cipher
Paper #	ISEC2004-16
Date of Issue

Conference Information
Committee	ISEC
Conference Date	2004/7/13(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)	Secure Double Block Length Hash Functions Based on Abreast/Tandem Davies-Meyer
Sub Title (in English)
Keyword(1)	abreast Davies-Meyer
Keyword(2)	tandem Davies-Meyer
Keyword(3)	double-block-length hash function
Keyword(4)	black-box model
Keyword(5)	block cipher
1st Author's Name	Shoichi HIROSE
1st Author's Affiliation	Graduate School of Informatics, Kyoto University()
Date	2004-07-20
Paper #	ISEC2004-16
Volume (vol)	vol.104
Number (no)	199
Page	pp.pp.-
#Pages	6
Date of Issue