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
f23K9s2c8@1M7q4)9K6b7g2)9J5c8W2)9J5c8X3y4J5P5i4m8@1L8$3#2W2i4K6u0W2L8%4u0Y4i4K6u0r3N6$3q4F1k6#2)9#2k6Y4y4Z5j5e0q4Q4y4h3k6$3x3W2)9J5k6i4A6A6M7l9`.`. (20 pages, PDF Zipped)
