Efficient Collision Search Attacks on SHA-0

Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin

View Related Documents

Book Chapter
Finding Collisions in the Full SHA-1
Xiaoyun Wang, Yiqun Lisa Yin and Hongbo Yu
Lecture Notes in Computer Science, 2005, Volume 3621, Advances in Cryptology – CRYPTO 2005, Pages 17-36
- Download PDF (468.6 KB)
Book Chapter
Cryptanalysis of the Hash Functions MD4 and RIPEMD
Xiaoyun Wang, Xuejia Lai, Dengguo Feng, Hui Chen and Xiuyuan Yu
Lecture Notes in Computer Science, 2005, Volume 3494, Advances in Cryptology – EUROCRYPT 2005, Page 551
- Download PDF (199.8 KB)
Book Chapter
Collisions on SHA-0 in One Hour
Stéphane Manuel and Thomas Peyrin
Lecture Notes in Computer Science, 2008, Volume 5086, Fast Software Encryption, Pages 16-35
- Download PDF (524.4 KB)
Book Chapter
Hash Functions and the (Amplified) Boomerang Attack
Antoine Joux and Thomas Peyrin
Lecture Notes in Computer Science, 2007, Volume 4622, Advances in Cryptology - CRYPTO 2007, Pages 244-263
- Download PDF (484.0 KB)
Book Chapter
Hardware Architecture and Cost Estimates for Breaking SHA-1
Akashi Satoh
Lecture Notes in Computer Science, 2005, Volume 3650, Information Security, Pages 259-273
- Download PDF (263.2 KB)
Book Chapter
How to Break MD5 and Other Hash Functions
Xiaoyun Wang and Hongbo Yu
Lecture Notes in Computer Science, 2005, Volume 3494, Advances in Cryptology – EUROCRYPT 2005, Page 561
- Download PDF (242.2 KB)
Book Chapter
Collision-Resistant Usage of MD5 and SHA-1 Via Message Preprocessing
Michael Szydlo and Yiqun Lisa Yin
Lecture Notes in Computer Science, 2006, Volume 3860, Topics in Cryptology – CT-RSA 2006, Pages 99-114
- Download PDF (381.5 KB)
Book Chapter
New Message Difference for MD4
Yu Sasaki, Lei Wang, Kazuo Ohta and Noboru Kunihiro
Lecture Notes in Computer Science, 2007, Volume 4593, Fast Software Encryption, Pages 329-348
- Download PDF (565.8 KB)
Book Chapter
Practical Collisions for SHAMATA-256
Sebastiaan Indesteege, Florian Mendel, Bart Preneel and Martin Schläffer
Lecture Notes in Computer Science, 2009, Volume 5867, Selected Areas in Cryptography, Pages 1-15
- Download PDF (239.9 KB)
Book Chapter
Attacking Reduced Round SHA-256
Somitra Kumar Sanadhya and Palash Sarkar
Lecture Notes in Computer Science, 2008, Volume 5037, Applied Cryptography and Network Security, Pages 130-143
- Download PDF (487.3 KB)

Abstract

In this paper, we present new techniques for collision search in the hash function SHA-0. Using the new techniques, we can find collisions of the full 80-step SHA-0 with complexity less than 2³⁹ hash operations.

Keywords Hash functions - Collision search attacks - SHA-0 - SHA-1

Fulltext Preview

Image of the first page of the fulltext document

Frequently asked questions General info on journals and books Send us your feedback Impressum Contact us

SpringerLink

Efficient Collision Search Attacks on SHA-0

View Related Documents

Abstract

Fulltext Preview