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
From Collisions to Chosen-Prefix Collisions Application to Full SHA-1
Gaëtan Leurent,Thomas Peyrin +1 more
TL;DR: Choi-prefix collisions as discussed by the authors is a stronger variant of a collision attack, where an arbitrary pair of challenge prefixes are turned into a collision, but the practical impact of such an attack is much larger.
Posted Content
Using the Cloud to Determine Key Strengths.
TL;DR: In this article, the authors developed a new methodology to assess cryptographic key strength using cloud computing, by calculating the true economic cost of (symmetricor private-) key retrieval for the most common cryptographic primitives.
Posted Content
Near-Collisions on the Reduced-Round Compression Functions of Skein and BLAKE.
TL;DR: In this article, the authors proposed improved near-collision attacks on the reduced-round compression functions of Skein and a variant of BLAKE, based on linear differentials of the modular additions.
Journal ArticleDOI
SHA-2 Acceleration Meeting the Needs of Emerging Applications: A Comparative Survey
TL;DR: The work presents a comprehensive review of the different design techniques available in the literature for SHA-2 acceleration, guiding the designer through the identification of the appropriate technique mixes which meet the constraints of any given application.
Dissertation
Analysis and design security primitives based on chaotic systems for ecommerce
TL;DR: Novel hash functions, encryption algorithms and pseudorandom number generators based on chaotic systems for electronic commerce are proposed and several analyses and computer simulations are performed on the proposed algorithms to verify that these proposed algorithms satisfy the characteristics and conditions of security algorithms.
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.