Advertisement

Differential collisions in SHA-0

  • Florent Chabaud
  • Antoine Joux
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1462)

Abstract

In this paper we present a method for finding collisions in SHA-0 which is related to differential cryptanalysis of block ciphers. Using this method, we obtain a theoretical attack on the compression function SHA-0 with complexity 261, which is thus better than the birthday paradox attack. In the case of SHA-1, this method is unable to find collisions faster than the birthday paradox. This is a strong evidence that the transition to version 1 indeed raised the level of security of SHA.

Keywords

Hash Function Block Cipher Compression Function Elementary Probability Message Block 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    E. Biham, and A. Shamir. Cryptanalysis of the Full 16-Round DES, CRYPTO'92 LNCS 740, pp 487–496, 1993.zbMATHGoogle Scholar
  2. 2.
    B. den Boer, and A. Bosselaers. Collisions for the compression function of MD5, EUROCRYPT'93 LNCS 773, pp 293–304, 1994.Google Scholar
  3. 3.
    A. Canteaut, and F. Chabaud. A new algorithm for finding minimum-weight words in a linear code: Application to primitive narrow-sense BCH codes of length 511, IEEE Trans. Inform. Theory, IT-44(1), pp 367–378, Jan. 1998.MathSciNetCrossRefGoogle Scholar
  4. 4.
    H. Dobbertin. Cryptanalysis of MD4, Fast Software Encryption LNCS 1039, pp 53–69, 1996.Google Scholar
  5. 5.
    R. Rivest. The MD4 Message-Digest Algorithm, CRYPTO'90 LNCS 537, pp 303–311, 1991.zbMATHGoogle Scholar
  6. 6.
    R. Rivest. The MD5 Message-Digest Algorithm, Network Working Group Request for Comments: 1321, April 1992. http://theory.lcs.mit.edu/~rivest/Rivest-MD5.txtGoogle Scholar
  7. 7.
    Secure Hash Standard. Federal Information Processing Standard Publication # 180, U.S. Department of Commerce, National Institute of Standards and Technology, 1993.Google Scholar
  8. 8.
    Secure Hash Standard. Federal Information Processing Standard Publication # 180-1, U.S. Department of Commerce, National Institute of Standards and Technology, 1995 (addendum to [7]).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Florent Chabaud
    • 1
  • Antoine Joux
    • 1
  1. 1.Centre d'électronique de l'ArmementCASSI/SCY/ECRennes ArméesFrance

Personalised recommendations