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

Authors:
Jun Yajima;Terutoshi Iwasaki;Yusuke Naito;Yu Sasaki;Takeshi Shimoyama;Noboru Kunihiro;Kazuo Ohta
Affiliations:
Fujitsu Laboratories Ltd., Kawasaki, Kanagawa, Japan;Chuo-University, Tokyo, Japan;The University of Electro-Communications, Tokyo, Japan;The University of Electro-Communications, Tokyo, Japan;Fujitsu Laboratories Ltd., Kanagawa, Japan;The University of Electro-Communications, Tokyo, Japan;The University of Electro-Communications, Tokyo, Japan
Venue:
Proceedings of the 2008 ACM symposium on Information, computer and communications security
Year:
2008

Citing 7
Cited 2

Differential Collisions in SHA-0

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A new strategy for finding a differential path of SHA-1

ACISP'07 Proceedings of the 12th Australasian conference on Information security and privacy
Improved collision search for SHA-0

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
The impact of carries on the complexity of collision attacks on SHA-1

FSE'06 Proceedings of the 13th international conference on Fast Software Encryption
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

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
Classification and generation of disturbance vectors for collision attacks against SHA-1

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a new algorithm for evaluating the number of chaining variable conditions(CVCs) in the selecting step of a distrubance vector (DV) for the analysis of SHA-1 collision attack. The algorithm is constructed by combining the following four strategies, "Strict Differential Bit Compression", "DV expansion", "Precise Counting Rules in Every Step" and "Differential Path Confirmation for Rounds 2 to 4", that can evaluate the number of CVCs morestrictly compared with the previous approach.