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
Using RC4-BHF to Construct One-way Hash Chains
Qian Yu,Chang N. Zhang +1 more
TL;DR: This chapter describes how to use RC4-BHF to construct efficient one-way hash chains and proposes a construction for one- way hash chains that is efficient and designed for ultra-low-power devices.
Posted Content
Do We Need to Vary the Constants? (Methodological Investigation of Block-Cipher Based Hash Functions).
Donghoon Chang,Moti Yung +1 more
TL;DR: This work presents a methodological investigation into the case of block-cipher based PGV hash functions family, and investigates the importance of constants in securing these designs, and suggests new AES-based hash function constructions which can be generalized to any block cipher.
Journal ArticleDOI
Preimage Attacks on 4-Round Keccak by Solving Multivariate Quadratic Systems
TL;DR: In this paper , the Crossbred algorithm was revisited for solving the Boolean multivariate quadratic (MQ) system and elaborate the computational complexity for the case $$D = 2$$ .
Posted Content
Message Modification for Step 21-23 on SHA-0.
TL;DR: In CRYPTO 2005, Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin proposed an ecient collision attack on SHA-0, and collision messages are found with complexity 2 39SHA-0 operations by using their method.
Journal ArticleDOI
Classification of disturbance vectors for collision attack in SHA-1
TL;DR: It is proved that there are only two types of the optimal disturbance vectors, type-I and type-II, which have minimum weight of 25 in the last 60 of the 80 expanded words, in the total 2512 disturbance vectors searching space.
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.