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
Impact of rotations in SHA-1 and related hash functions
TL;DR: In this article, the authors focus on SHA-1-like hash functions and evaluate the security implications of using multiple sets of rotation constants in the compression function instead of a single set.
Journal ArticleDOI
Design and Analysis of a New Hash Algorithm with Key Integration
TL;DR: A new keyed hash function is proposed and described that produces a hash code of 128 bits for an arbitrary length input and uses a key during hashing, so any intruder that does not know key, cannot forge the hash code, and, thus it fulfills the purpose of security, authentication and integrity for a message in network.
Book ChapterDOI
Practical Collision Attack on 40-Step RIPEMD-128
Gaoli Wang,Gaoli Wang +1 more
TL;DR: This paper presents collision differential characteristics for both line1 operation and line2 operation by choosing a proper message difference and improves the probabilities of the differential characteristics so that a collision attack on 40-step RIPEMD-128 with a complexity of 235 computations is given.
Journal ArticleDOI
Finding Collisions against 4-round SHA3-384 in Practical Time
TL;DR: This work improves upon previous results by utilising three ideas which were not used in previous works on collision attacks against SHA-3, and proposes an efficient deduce-and-sieve algorithm on the basis of two new non-random properties of the Keccak non-linear layer.
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.