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
Posted Content
Bicliques for permutations: collision and preimage attacks in stronger settings.
TL;DR: In this article, the concept of sliced bicliques was introduced for the cryptanalysis of block ciphers and hash functions, which allows to convert preimage attacks into collision attacks and derive collision attacks on the reduced SHA-3 finalist Skein in the hash function setting up to 11 rounds.
Posted Content
Cryptanalysis of a class of cryptographic hash functions.
Praveen Gauravaram,John Kelsey +1 more
TL;DR: This work applies new cryptanalytical techniques to perform the generic multi-block multicollision, second preimage and herding attacks on the Damgard-Merkle hash functions with linear-XOR/additive checksums.
Proceedings ArticleDOI
On-the-fly attestation of reconfigurable hardware
TL;DR: In this paper, the hash value computation is implemented in hardware on the FPGA itself to optimize this attestation, and the proposed hardware module also enforces region delimitation to guarantee the integrity of the existing computation architecture.
Journal ArticleDOI
Server side hashing core exceeding 3 Gbps of throughput
Harris E. Michail,George A. Panagiotakopoulos,V. Thanasoulis,Athanasios Kakarountas,Costas E. Goutis +4 more
TL;DR: A new technique is presented for increasing frequency and throughput of the currently most used hash function, which is SHA-1, which involves the application of spatial and temporal precomputation and leads to an implementation with more than 75% higher throughput.
Book ChapterDOI
Rescheduling for optimized SHA-1 calculation
TL;DR: In this article, the authors propose the rescheduling of the SHA-1 hash function operations on hardware implementations, which allows for a manipulation of the critical path in the hash function computation, facilitating the implementation of a more parallelized structure without an increase on the required hardware resources.
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.