Presentation 2013-03-07
A discussion about efficient double length hash function
Tsuyoshi SAWADA, Atsuko MIYAJI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Hash function is a function which maps input of arbitrary length into output fixed length. In this article, it states double block length hash function based blockcipher. There are three well-known methods, Weimar Davies-Meyer, Abreast Davies-Meyer, Hirose06. These methods are shown that its secrity is ideal. But, thier rate is all 1/2, where rate is index of efficiency of hash function. Their rate have been improved for 20 tears over. In this article, we propose hash function with high rate possible. The proposal method uses n-bit blockcipher with n-bit key length. After estimating of secrity, we discuss the proposal.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) ideal cipher model / hash function / blockcipher based compression function / collision resistance / preimage resistance / rate
Paper # IT2012-66,ISEC2012-84,WBS2012-52
Date of Issue

Conference Information
Committee ISEC
Conference Date 2013/2/28(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) A discussion about efficient double length hash function
Sub Title (in English)
Keyword(1) ideal cipher model
Keyword(2) hash function
Keyword(3) blockcipher based compression function
Keyword(4) collision resistance
Keyword(5) preimage resistance
Keyword(6) rate
1st Author's Name Tsuyoshi SAWADA
1st Author's Affiliation Japan Advanced Institute of Science and Technology()
2nd Author's Name Atsuko MIYAJI
2nd Author's Affiliation Japan Advanced Institute of Science and Technology
Date 2013-03-07
Paper # IT2012-66,ISEC2012-84,WBS2012-52
Volume (vol) vol.112
Number (no) 461
Page pp.pp.-
#Pages 6
Date of Issue