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
Journal ArticleDOI
Differential entropy analysis of the IDEA block cipher
TL;DR: A new cryptanalytic technique that combines differential cryptanalysis with Shannon entropy to exploit the non-uniform distribution of output differences from a given mapping as a distinguishing tool in cryptanalysis is described.
Electronic Contract Administration – Legal and Security Issues Literature Review
Ed Dawson,Sharon Christensen,Ernest Foo,Audun Jøsang,Praveen Gauravaram,Kathryn L. O'Shea,Judith McNamara +6 more
TL;DR: In this paper, the authors present the results of a literature review of various national and international publications, legislation and court decisions relevant to electronic contracting and identify the legal and security issues that may arise in connection with the formation of construction contracts within an electronic environment.
Dissertation
Error correcting codes: local testing, list decoding, and applications
TL;DR: It is proved that a code similar to the SHA-1 (Secure Hash Algorithms) message expansion code has minimum distance at least 82, and that too in just the last 64 of the 80 expanded words.
Journal Article
Preimage Attack on Reduced DHA-256
Jinmin Zhong,Xuejia Lai +1 more
TL;DR: The preimage resistance of 35-step DHA-256 has been analyzed in this article, showing that pseudo-preimage and preimage can be obtained with time complexity of 2 240 and 2 249 compression function operations, respectively.
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.