A new strategy for finding a differential path of SHA-1

Authors:
Jun Yajima;Yu Sasaki;Yusuke Naito;Terutoshi Iwasaki;Takeshi Shimoyama;Noboru Kunihiro;Kazuo Ohta
Affiliations:
FUJITSU LABORATORIES LTD., Nakahara-ku, Kawasaki, Japan;The University of Electro-Communications, Chofu-shi, Tokyo, Japan;The University of Electro-Communications, Chofu-shi, Tokyo, Japan;Chuo University, Tokyo, Japan;FUJITSU LABORATORIES LTD., Nakahara-ku, Kawasaki, Japan;The University of Electro-Communications, Chofu-shi, Tokyo, Japan;The University of Electro-Communications, Chofu-shi, Tokyo, Japan
Venue:
ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Year:
2007

Citing 3
Cited 3

Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
How to break MD5 and other hash functions

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Collisions of SHA-0 and reduced SHA-1

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

A strict evaluation method on the number of conditions for the SHA-1 collision search

Proceedings of the 2008 ACM symposium on Information, computer and communications security
Second-preimage analysis of reduced SHA-1

ACISP'10 Proceedings of the 15th Australasian conference on Information security and privacy
Matrix representation of conditions for the collision attack of SHA-1 and its application to the message modification

IWSEC'10 Proceedings of the 5th international conference on Advances in information and computer security

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path of Round 1 is very complex, and it takes much time to find one by hand. Therefore, we propose a new search algorithm that consists of three sub searches, naming the forward search, the backward search, and the joint search, so that we can find a differential path by computers. By implementing our new algorithm and doing some experiments on a computer, we actually found 383 differential paths in the joint search that are different from Wang's. Since it is designed by quite a new policy, our algorithm can search a range of space that was not examined by existing algorithms.