Presentation 2008-07-25
Analysis on the Pseudorandom-Function Property of the SHA-256 Compression Function
Hidenori KUWAKADO, Shoichi HIROSE,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Applications of an iterated hash function such as HMAC require that the compression function of the hash function is a pseudorandom function, that is, it is computationally infeasible to distinguish between the compression function and a random function. This paper shows that it is easy to distinguish between the 22 step-reduced SHA-256 compression function and the random function.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) SHA-256 / compression function / pseudorandom function
Paper # ISEC2008-46
Date of Issue

Conference Information
Committee ISEC
Conference Date 2008/7/17(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 on the Pseudorandom-Function Property of the SHA-256 Compression Function
Sub Title (in English)
Keyword(1) SHA-256
Keyword(2) compression function
Keyword(3) pseudorandom function
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, The University of Fukui
Date 2008-07-25
Paper # ISEC2008-46
Volume (vol) vol.108
Number (no) 162
Page pp.pp.-
#Pages 6
Date of Issue