1 Shandong University, Jinan 250100, China
2 Independent Security Consultant, Greenwich CT, US
3 Shandong University, Jinan250100, China
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 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.
Dated June 1, 2005
http://cryptome.org/wang_sha1_v2.zip (20 pages, PDF Zipped)
