scispace - formally typeset
Open AccessBook ChapterDOI

Improved collision search for SHA-0

Reads0
Chats0
TLDR
Submarine modification is an extension of the multi-message modification used in collision attacks on the MD-family as discussed by the authors, which can be used to generate a collision with high probability.
Abstract
At CRYPTO2005, Xiaoyun Wang, Hongbo Yu and Yiqun Lisa Yin proposed a collision attack on SHA-0 that could generate a collision with complexity 239 SHA-0 hash operations. Although the method of Wang et al. can find messages that satisfy the sufficient conditions in steps 1 to 20 by using message modification, it makes no mention of the message modifications needed to yield satisfaction of the sufficient conditions in steps 21 and onwards. In this paper, first, we give sufficient conditions for the steps from step 21, and propose submarine modification as the message modification technique that will ensure satisfaction of the sufficient conditions from steps 21 to 24. Submarine modification is an extension of the multi-message modification used in collision attacks on the MD-family. Next, we point out that the sufficient conditions given by Wang et al. are not enough to generate a collision with high probability; we rectify this shortfall by introducing two new sufficient conditions. The combination of our newly found sufficient conditions and submarine modification allows us to generate a collision with complexity 236 SHA-0 hash operations. At the end of this paper, we show the example of a collision generated by applying our proposals.

read more

Content maybe subject to copyright    Report

Citations
More filters
Book ChapterDOI

Finding SHA-1 characteristics: general results and applications

TL;DR: A method to search for characteristics in an automatic way for multi-block attacks, and as a proof of concept, gives a two-block collision for 64-step SHA-1 based on a new characteristic.
Book ChapterDOI

Bicliques for preimages: attacks on skein-512 and the SHA-2 family

TL;DR: The concept of biclique as a tool for preimage attacks was introduced in this paper, which employs many powerful techniques from differential cryptanalysis of block ciphers and hash functions.
Journal Article

Collisions for 70-Step SHA-1: On the Full Cost of Collision Search

TL;DR: In this article, the authors survey different techniques for fast collision search in SHA-1 and similar hash functions and propose a simple but effective method to facilitate comparison, and give complexity estimates and performance measurements of this new and improved collision search method.
Journal ArticleDOI

Classification and generation of disturbance vectors for collision attacks against SHA-1

TL;DR: It is shown that all published disturbance vectors can be classified into two types of vectors, type-I and type-II, and a deterministic algorithm is presented which produces efficient disturbance vectors with respect to any given cost function.
Book ChapterDOI

Collisions on SHA-0 in One Hour

TL;DR: This paper shows that the previous perturbation vectors used in all known attacks are not optimal and provides a new 2-block one and is able to produce the best collision attack against SHA-0 so far, with a measured complexity of 233,6hash function calls.
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

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.