Presentation 1998/11/20
A study on the collision search of MD5
Naoki TAJIMA, Akihiro OHKAWA, Toshinobu KANEKO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) MD5 is a hash function proposed by R.Rivest, which a strengthened version of MD4. Hans Dobbertin has already shown that MD4 is not collision-free by his algorithm. We studied the possibility of collision for MD5. The basic strategy is that a small difference between input variables can be controlled in a way that the difference in the computations of two associated hash valued are compensated. MD5 is composed of four processing rounds. We analyzed algebraicaly the difference propagation through the processing rounds. In the consequence we found an inner collision in the first two rounds.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) MD5 / collision / hash function
Paper # ISEC98-36
Date of Issue

Conference Information
Committee ISEC
Conference Date 1998/11/20(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 study on the collision search of MD5
Sub Title (in English)
Keyword(1) MD5
Keyword(2) collision
Keyword(3) hash function
1st Author's Name Naoki TAJIMA
1st Author's Affiliation Department of Electronics Engineering, Science University of Tokyo()
2nd Author's Name Akihiro OHKAWA
2nd Author's Affiliation Department of Electronics Engineering, Science University of Tokyo
3rd Author's Name Toshinobu KANEKO
3rd Author's Affiliation Department of Electronics Engineering, Science University of Tokyo
Date 1998/11/20
Paper # ISEC98-36
Volume (vol) vol.98
Number (no) 426
Page pp.pp.-
#Pages 7
Date of Issue