The Impact of Carries on the Complexity of Collision Attacks on SHA-1

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4047)


In this article we present a detailed analysis of the impact of carries on the estimation of the attack complexity for SHA-1. We build up on existing estimates and refine them. We show that the attack complexity is slightly lower than estimated in all published work to date. We point out that it is more accurate to consider probabilities instead of conditions.


Hash Function Hard Condition Compression Function Attack Strategy Easy Condition 
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.


  1. 1.
    Biham, E., Chen, R.: Near-collisions of SHA-0. In: Franklin, M.K. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 290–305. Springer, Heidelberg (2004)Google Scholar
  2. 2.
    Biham, E., Chen, R., Joux, A., Carribault, P., Lemuet, C., Jalby, W.: Collisions of SHA-0 and Reduced SHA-1. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 36–57. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  3. 3.
    Chabaud, F., Joux, A.: Differential Collisions in SHA-0. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 56–71. Springer, Heidelberg (1998)Google Scholar
  4. 4.
    Daum, M.: Cryptanalysis of Hash Functions of the MD4-Family. PhD thesis, Ruhr Universität Bochum, Available at (2005),
  5. 5.
    Dobbertin, H.: Cryptanalysis of MD4. In: Preneel, B. (ed.) Proceedings of Fast Software Encryption, Cambridge, UK, February 21-23. LNCS, vol. 1039, pp. 53–69. Springer, Heidelberg (1996)Google Scholar
  6. 6.
    Dobbertin, H.: Cryptanalysis of MD4. Journal of Cryptology 11(4), 253–271 (1998)zbMATHCrossRefGoogle Scholar
  7. 7.
    Jutla, C.S., Patthak, A.C.: A Matching Lower Bound on the Minimum Weight of SHA-1 Expansion Code. Cryptology ePrint Archive, Report 2005/266 (2005),
  8. 8.
    Jutla, C.S., Patthak, A.C.: A Simple and Provably Good Code for SHA Message Expansion. Cryptology ePrint Archive, Report 2005/247 (2005),
  9. 9.
    Klima, V.: Finding MD5 Collisions on a Notebook PC Using Multi-message Modifications, Preprint (2005), available at,
  10. 10.
    Lenstra, A., Wang, X., de Weger, B.: Colliding X.509 Certificates (2005) Preprint, available online at,
  11. 11.
    Matusiewicz, K., Pieprzyk, J.: Finding good differential patterns for attacks on SHA-1. Cryptology ePrint Archive, Report 2004/364 (2004),
  12. 12.
    National Institute of Standards and Technology (NIST). FIPS-180-2: Secure Hash Standard (August 2002) Available online at,
  13. 13.
    Pramstaller, N., Rechberger, C., Rijmen, V.: Exploiting Coding Theory for Collision Attacks on SHA-1. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 78–95. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  14. 14.
    Preneel, B.: Analysis and Design of Cryptographic Hash Functions. PhD thesis, Katholieke Universiteit Leuven (1993)Google Scholar
  15. 15.
    Rijmen, V., Oswald, E.: Update on SHA-1. In: Menezes, A. (ed.) CT-RSA 2005. LNCS, vol. 3376, pp. 58–71. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  16. 16.
    Wang, X., Feng, D., Lai, X., Yu, X.: Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD (August 2004), (Preprint) available at,
  17. 17.
    Wang, X., Lai, X., Feng, D., Chen, H., Yu, X.: Cryptanalysis of the Hash Functions MD4 and RIPEMD. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 1–18. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  18. 18.
    Wang, X., Yao, A., Yao, F.: New Collision Search for SHA-1. Presented at rump session of CRYPTO 2005 (August 2005)Google Scholar
  19. 19.
    Wang, X., Yin, Y.L., Yu, H.: Finding Collisions in the Full SHA-1. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 17–36. Springer, Heidelberg (2005)Google Scholar
  20. 20.
    Wang, X., Yu, H.: How to Break MD5 and Other Hash Functions. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19–35. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  21. 21.
    Wang, X., Yu, H., Yin, Y.L.: Efficient Collision Search Attacks on SHA-0. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 1–16. Springer, Heidelberg (2005)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  1. 1.Institute for Applied Information Processing and Communications (IAIK)Graz University of TechnologyAustria

Personalised recommendations