Presentation 2004-11-09
Complexity of the Chabaud-Joux Attack on SHA-0 with Different Message Schedules
Mitsuhiro HATTORN, Shouichi HIROSE, Susumu YOSHIDA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) SHA-O employs a primitive polynomial of degree 16 over GF (2) in its message scheduling. There are 2048 primitive polynomials of degree 16 over GF (2). For each primitive polynomial, a SHA-O variant is constructed. In this paper, the security of 2048 variants is analyzed against the Chabaud-Joux attack proposed in CRYPTO'98. The analysis shows some variants are totally resistant to the attack and the original SHA-0 is not so resistant. Furthermore, a collision in the most vulnerable variant is presented. It is obtained by the original Chabaud-Joux attack without any improvements.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) SHA-O / Chabaud-Joux attack / message schedule
Paper # ISEC2004-97,OIS2004-64
Date of Issue

Conference Information
Committee ISEC
Conference Date 2004/11/2(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) Complexity of the Chabaud-Joux Attack on SHA-0 with Different Message Schedules
Sub Title (in English)
Keyword(1) SHA-O
Keyword(2) Chabaud-Joux attack
Keyword(3) message schedule
1st Author's Name Mitsuhiro HATTORN
1st Author's Affiliation Graduate School of Informatics, Kyoto University()
2nd Author's Name Shouichi HIROSE
2nd Author's Affiliation Graduate School of Informatics, Kyoto University
3rd Author's Name Susumu YOSHIDA
3rd Author's Affiliation Graduate School of Informatics, Kyoto University
Date 2004-11-09
Paper # ISEC2004-97,OIS2004-64
Volume (vol) vol.104
Number (no) 422
Page pp.pp.-
#Pages 7
Date of Issue