A study on the collision search of MD5

3 References
  • TAJIMA Naoki
    Department of Electronics Engineering, Science University of Tokyo
  • OHKAWA Akihiro
    Department of Electronics Engineering, Science University of Tokyo
  • KANEKO Toshinobu
    Department of Electronics Engineering, Science University of Tokyo

Bibliographic Information

Other Title
  • MD5の衝突に関する一検討

Search this article

Description

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.

Journal

  • Technical report of IEICE. ISEC

    Technical report of IEICE. ISEC 98 (426), 1-7, 1998-11-20

    The Institute of Electronics, Information and Communication Engineers

References(3)*help

See more

Keywords

Details 詳細情報について

  • CRID
    1571698602293079424
  • NII Article ID
    110003297357
  • NII Book ID
    AN10060811
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top