Efficient collision search attacks on SHA-0
Xiaoyun Wang,Hongbo Yu,Yiqun Lisa Yin +2 more
- pp 1-16
TLDR
Using the new techniques, this paper can find collisions of the full 80-step SHA-0 with complexity less than 239 hash operations.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 239 hash operations.read more
Citations
More filters
Book ChapterDOI
Constructing an ideal hash function from weak ideal compression functions
TL;DR: It is proved that the construction of the zipper hash function, which is called the "zipper hash," is ideal in the sense that the overall hash function is indistinguishable from a random oracle when implemented with these weak ideal building blocks.
Journal ArticleDOI
Classification and generation of disturbance vectors for collision attacks against SHA-1
TL;DR: It is shown that all published disturbance vectors can be classified into two types of vectors, type-I and type-II, and a deterministic algorithm is presented which produces efficient disturbance vectors with respect to any given cost function.
Book ChapterDOI
The second-preimage attack on MD4
TL;DR: Another new collision differential path is found which can be used to find the second-preimage for more weak messages.
Book ChapterDOI
On the security of HMAC and NMAC based on HAVAL, MD4, MD5, SHA-0 and SHA-1 (extended abstract)
TL;DR: In this paper, two new distinguishers of the structure of HMAC, called differential and rectangle distinguishers, were devised, and used to discuss the security of the HMAC based on HAVAL, MD4, MD5, SHA-0 and SHA-1.
Book ChapterDOI
On the impossibility of highly-efficient blockcipher-based hash functions
TL;DR: It is proved, in the ideal-cipher model, that it is impossible to construct a highly-efficient iterated blockcipher-based hash function that is provably secure.
References
More filters
Book ChapterDOI
Finding collisions in the full SHA-1
TL;DR: This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound, and it is shown that collisions ofSHA-1 can be found with complexityLess than 269 hash operations.
Book ChapterDOI
How to break MD5 and other hash functions
Xiaoyun Wang,Hongbo Yu +1 more
TL;DR: A new powerful attack on MD5 is presented, which unlike most differential attacks, does not use the exclusive-or as a measure of difference, but instead uses modular integer subtraction as the measure.
Journal Article
Advances in Cryptology - EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques
TL;DR: This paper discusses Cryptography in High Dimensional Tori, a Tool Kit for Finding Small Roots of Bivariate Polynomials over the Integers, and reducing Complexity Assumptions for Statistically-Hiding Commitment.
BookDOI
Advances in Cryptology – CRYPTO 2004
TL;DR: A formal statistical framework for block cipher attacks based on this technique is developed and explicit and compact gain formulas for generalized versions of Matsui’s Algorithm 1 and Algorithm 2 are derived.