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
OVER: overhauling vulnerability detection for iot through an adaptable and automated static analysis framework
TL;DR: The proposed static analysis framework for IoT is designed for detecting security vulnerabilities such as Buffer Overflow, Memory Leaks, Code Injection, TOCTOU, Banned functions, and other code-related vulnerabilities.
Cryptanalysis of Hash Functions
TL;DR: A new family of sponge-based lightweight hash function called spongent is proposed and its security analysis is presented by applying the most important state-of-the-art methods of cryptanalysis and by investigating their complexity.
Journal Article
Related-Key Attacks on the Py-Family of Ciphers and an Approach to Repair the Weaknesses
TL;DR: A distinguishing attack on TPypy with data complexity 2192 is shown which is lower than the previous best known attack on the cipher by a factor of 288 and it is conjecture that no attacks lower than brute force are possible on the RCR ciphers.
Posted Content
Weaknesses of the FORK-256 compression function.
TL;DR: In this paper, the authors present a method of finding chosen IV collisions for a variant of FORK-256 reduced to two branches, either 1 and 2 or 3 and 4.
Journal ArticleDOI
World of code: enabling a research workflow for mining and analyzing the universe of open source VCS data
Yuxing Ma,Tapajit Dey,Christopher Bogart,Sadika Amreen,Marat Valiev,Adam Tutko,David Kennard,Russell Zaretzki,Audris Mockus +8 more
TL;DR: WoC as mentioned in this paper is a collection of version control data in the entire FLOSS ecosystems named World of Code (WoC), that can completely cross-reference authors, projects, commits, blobs, dependencies, and history of the FLOSS ecosystem and provide capabilities to efficiently correct, augment, query, and analyze that data.
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.