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
Family of Parameterized Hash Algorithms
Przemysław Rodwald,J. Stoklosa +1 more
TL;DR: A new approach is presented, where few elements of hash function are parameterized, which makes the hash algorithm more secure and more flexible.
Enhancing the Integrity of Short Message Service (SMS) in New Generation Mobile Devices
TL;DR: The truth is ascertained that it is feasible to falsify an SMS in android mobile phone and the integrity of new generation mobile devices like android based phones is broken down by modifying the SMS (changing timestamps, text and finally sender identity).
Journal Article
MAYHAM - A New Hash Function
TL;DR: MAYHAM is designed as a simple and efficient hash function as compared to other dedicated hash functions and supports parallel processing in its compression function and can be efficiently implemented by using lookup tables.
Journal ArticleDOI
Behördliche Vorgaben zu kryptografischen Algorithmen
TL;DR: Das BSI kann verhindert werden, dass ungeeignete Produkte with Schwachstellen oder manipulierte IT-Komponenten in der Bundesverwaltung and in den Regierungsnetzen zum Einsatz kommen.
FORK-160: A New 160 - bit Software-Oriented Hash Function
TL;DR: ForK-160 aims at improving FORK-256 both on security and efficiency and uses more secure step function, reasonable message ordering and additive constants which make it resistant against existing cryptanalysis especially local collision attacks.
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.