Finding Collisions in the Full SHA-1

Xiaoyun Wang; Yiqun Lisa Yin; Hongbo Yu

doi:10.1007/11535218_2

Annual International Cryptology Conference

CRYPTO 2005: Advances in Cryptology – CRYPTO 2005 pp 17-36

Finding Collisions in the Full SHA-1

Authors
Authors and affiliations

Xiaoyun Wang
Yiqun Lisa Yin
Hongbo Yu

Conference paper

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3621)

Abstract

In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 2⁶⁹ hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 2⁸⁰ theoretical bound.

Keywords

Hash functions collision search attacks SHA-1 SHA-0

Download to read the full conference paper text

References

1.
Biham, E., Chen, R.: Near-collisions of SHA-0. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 290–305. Springer, Heidelberg (2004)Google Scholar
2.
Biham, E., Chen, R.: New Results on SHA-0 and SHA-1. In: Crypto 2004 Rump Session (August 2004)Google Scholar
3.
Biham, E., Chen, R., Joux, A., Carribault, P., Jalby, W., Lemuet, C.: Collisions in SHA-0 and Reduced SHA-1. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 36–57. Springer, Heidelberg (2005)CrossRefGoogle Scholar
4.
NIST. Secure hash standard. Federal Information Processing Standard, FIPS-180 (May 1993)Google Scholar
5.
NIST. Secure hash standard. Federal Information Processing Standard, FIPS-180-1 (April 1995)Google Scholar
6.
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
7.
Joux, A.: Collisions for SHA-0. In: Rump session of Crypto 2004 (August 2004)Google Scholar
8.
Matusiewicz, K., Pieprzyk, J.: Finding Good Differential Patterns for Attacks on SHA-1. IACR Eprint archive (December 2004)Google Scholar
9.
Rijmen, V., Osward, E.: Update on SHA-1. RSA Crypto Track 2005 (2005)Google Scholar
10.
Wang, X.Y., Feng, D.G., Lai, X.J., Yu, H.B.: Collisions for Hash Functions MD4, MD5, HAVAL-128 and RIPEMD. In: Rump session of Crypto 2004 and IACR Eprint archive (August 2004)Google Scholar
11.
Wang, X.Y., Feng, D.G., Yu, X.Y.: The Collision Attack on Hash Function HAVAL-128. Science in China, Series E 35(4), 405–416 (2005) (in Chinese)Google Scholar
12.
Wang, X.Y., Yu, H.B.: 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
13.
Wang, X.Y., Lai, X.J., Feng, D.G., Chen, H., Yu, X.Y.: Cryptanalysis for Hash Functions MD4 and RIPEMD. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 1–18. Springer, Heidelberg (2005)CrossRefGoogle Scholar
14.
Wang, X.Y.: The Collision attack on SHA-0 (1997), http://www.infosec.edu.cn (in Chinese) (to appear)
15.
Wang, X.Y.: The Improved Collision attack on SHA-0 (1998), http://www.infosec.edu.cn (in Chinese) (to appear)
16.
Wang, X.Y., Yu, H.B., Yin, Y.L.: Efficient Collision Search Attacks on SHA-0. In: These proceedings (2005)Google Scholar

Copyright information

Authors and Affiliations

Xiaoyun Wang
- 1
Yiqun Lisa Yin
- 2
Hongbo Yu
- 3

1.Shandong UniversityJinanChina
2.Independent Security ConsultantGreenwichUS
3.Shandong UniversityJinanChina

About this paper

Cite this paper as:: Wang X., Yin Y.L., Yu H. (2005) Finding Collisions in the Full SHA-1. In: Shoup V. (eds) Advances in Cryptology – CRYPTO 2005. CRYPTO 2005. Lecture Notes in Computer Science, vol 3621. Springer, Berlin, Heidelberg

DOI https://doi.org/10.1007/11535218_2
Publisher Name Springer, Berlin, Heidelberg
Print ISBN 978-3-540-28114-6
Online ISBN 978-3-540-31870-5
eBook Packages Computer Science

Finding Collisions in the Full SHA-1

Abstract

Keywords

Copyright information

Authors and Affiliations

Personalised recommendations

Export citation

Cookies