Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

New strategy for searching disturbance vector of SHA-1 collision attack

This is a preview of subscription content, log in to check access.


  1. 1

    Manuel S. Classification and generation of disturbance vectors for collision attacks against SHA-1. Des Codes Cryptogr, 2011, 59: 247–263

  2. 2

    Wang X Y, Yin Y L, Yu H B. Finding collisions in the full SHA-1. In: Proceedings of the 25th Annual International Conference on Advances in Cryptology, Santa Barbara, 2005. 17–36

  3. 3

    Stevens M, Karpman P, Peyrin T. Freestart collision for full SHA-1. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. Berlin: Springer, 2016

  4. 4

    Stevens M. New collision attacks on SHA-1 based on optimal joint local-collision analysis. In: Advances in Cryptology–EUROCRYPT. Berlin: Springer, 2013. 245–261

  5. 5

    Jutla C S, Patthak A C. A matching lower bound on the minimum weight of SHA-1 expansion code. Iacr Cryptol Eprint Arch, 2005

  6. 6

    Tang Y C, Zeng G, Han W B. Classification of disturbance vectors for collision attack in SHA-1. Sci China Inf Sci, 2015, 58: 112102

Download references


This work was supported by National Natural Science Foundation of China (Grant No. 61502532) and Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing (Grant No. 2016A02).

Author information

Correspondence to Hao Feng or Guang Zeng or Wenbao Han or Yang Yang.

Additional information

The authors declare that they have no conflict of interest.

Rights and permissions

Reprints and Permissions

About this article

Verify currency and authenticity via CrossMark

Cite this article

Feng, H., Zeng, G., Han, W. et al. New strategy for searching disturbance vector of SHA-1 collision attack. Sci. China Inf. Sci. 60, 129101 (2017).

Download citation