Finding collisions in the full SHA-1
Xiaoyun Wang,Yiqun Lisa Yin,Hongbo Yu +2 more
- pp 17-36
Reads0
Chats0
TLDR
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.Abstract:
In this paper, we present new collision search attacks on the hash function SHA-1. We show that collisions of SHA-1 can be found with complexity less than 269 hash operations. This is the first attack on the full 80-step SHA-1 with complexity less than the 280 theoretical bound.read more
Citations
More filters
Book ChapterDOI
Differential Biases in Reduced-Round Keccak
Sourav Das,Willi Meier +1 more
TL;DR: It is discovered that low-weight differentials produce a number of biased and fixed difference bits in the state after two rounds and a theoretical explanation for the existence of such a bias is provided.
Proceedings ArticleDOI
Efficiency and pseudo-randomness of a variant of Zémor-Tillich hash function
TL;DR: This paper considers a variant of ZT hash, a provably secure hash function designed by Zemor and Tillich proposed by J.P Tilich and G.Zemor (1994), and proposes optimized parameters and algorithms to increase the speed of both hash functions.
Book ChapterDOI
Improved Cryptanalysis of Reduced RIPEMD-160
TL;DR: An improved cryptanalysis of the double-branch hash function standard RIPEMD-160 is proposed using a carefully designed non-linear path search tool and it is shown that some of these message words can lead to very good differential path candidates.
References
More filters
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.