logo

SCIENCE CHINA Information Sciences, Volume 60, Issue 12: 129101(2017) https://doi.org/10.1007/s11432-016-9241-x

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

More info
  • ReceivedMay 25, 2017
  • AcceptedAug 16, 2017
  • PublishedNov 8, 2017

Abstract

There is no abstract available for this article.


Acknowledgment

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).


References

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

[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. Google Scholar

[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. Google Scholar

[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. Google Scholar

[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. Google Scholar

[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: 1-10 CrossRef Google Scholar

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1