2006 | OriginalPaper | Chapter
Finding SHA-1 Characteristics: General Results and Applications
Authors : Christophe De Cannière, Christian Rechberger
Published in: Advances in Cryptology – ASIACRYPT 2006
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The most efficient collision attacks on members of the SHA family presented so far all use complex characteristics which were manually constructed by Wang
et al
. In this report, we describe a method to search for characteristics in an automatic way. This is particularly useful for multi-block attacks, and as a proof of concept, we give a two-block collision for 64-step SHA-1 based on a new characteristic. The highest number of steps for which a SHA-1 collision was published so far was 58. We also give a unified view on the expected work factor of a collision search and the needed degrees of freedom for the search, which facilitates optimization.