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
Proceedings ArticleDOI
Mitigation and Improving SHA-1 Standard Using Collision Detection Approach
TL;DR: A collision detection methodology and an improved version of Secure Hash Algorithm (SHA-1) standard are introduced to protect weak primitives from any possible collision attack.
Journal ArticleDOI
A Collision-Mitigation Cuckoo Hashing Scheme for Large-Scale Storage Systems
TL;DR: The idea behind MinCounter is to alleviate the occurrence of endless loops in the data insertion by selecting unbusy kicking-out routes and improves the concurrency of the MinCounter scheme to pursue higher performance and adapt to concurrent applications.
Posted Content
Some thoughts on Collision Attacks in the Hash Functions MD5, SHA-0 and SHA-1.
TL;DR: It is concluded that the hash functions MD5, SHA-0 and SHA-1 did not consider the pseudo-collision attack in their design criteria and it is doubted whether these hash functions achieve the design principle of Merkle-Damg̊ard’s construction.
Posted Content
2-Dimension Sums: Distinguishers Beyond Three Rounds of RIPEMD-128 and RIPEMD-160.
Yu Sasaki,Lei Wang +1 more
TL;DR: In this paper, second-order differential paths are constructed on reduced RIPEMD-128 and -160, which leads to a practical 4-sum attack on 47 steps (out of 64 steps) of RIPEMd-128/160 and 40 steps(out of 80 steps).
Book ChapterDOI
Full Key-Recovery Attack on the HMAC/NMAC Based on 3 and 4-Pass HAVAL
Hongbo Yu,Xiaoyun Wang +1 more
TL;DR: The full key-recovery attacks on the HMAC/NMAC instantiated with 3 and 4-Pass HAVAL using the authors' new differential paths are given.
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.