Finding Collisions in the Full SHA-1 (2005)
by
Xiaoyun Wang
,
Yiqun Lisa Yin
,
Hongbo Yu
| Venue: | In Proceedings of Crypto |
| Citations: | 123 - 5 self |
BibTeX
@INPROCEEDINGS{Wang05findingcollisions,
author = {Xiaoyun Wang and Yiqun Lisa Yin and Hongbo Yu},
title = {Finding Collisions in the Full SHA-1},
booktitle = {In Proceedings of Crypto},
year = {2005},
pages = {17--36},
publisher = {Springer}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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 69 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 2 80 theoretical bound. Keywords: Hash functions, collision search attacks, SHA-1, SHA-0. 1
Citations
| 150 | How to break MD5 and other hash functions - Wang, Yu - 2005 |
| 49 | Near-Collisions of SHA-0 - Biham, Chen - 2004 |
| 26 | Secure hash standard - NIST - 1995 |
| 12 | Finding good differential patterns for attacks on SHA-1” eprint 2004 Available : http://eprint.iacr.org/2004/364.pdf - Matusiewicz, Pieprzyk |
| 8 | The Collision attack on SHA-0 - Wang - 1997 |
| 6 | Collisions for SHA-0, rump session of Crypto’04 - Joux - 2004 |
| 2 | Efficient Collision Search Attacks on SHA-0. These proceedings - Yu, Yin - 2005 |
