Improved collision attack on the hash function proposed at PKC'98

Authors:
Florian Mendel;Norbert Pramstaller;Christian Rechberger
Affiliations:
Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Graz, Austria;Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Graz, Austria;Institute for Applied Information Processing and Communications (IAIK), Graz University of Technology, Graz, Austria
Venue:
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Year:
2006

Citing 8
Cited 1

Full-Round Differential Attack on the Original Version of the Hash Function Proposed at PKC'98

SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Cryptanalysis of the Modified Version of the Hash Function Proposed at PKC'98

FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
A New Hash Function Based on MDx-Family and Its Application to MAC

PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
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
Efficient collision search attacks on SHA-0

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Finding collisions in the full SHA-1

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Cryptanalysis of the hash functions MD4 and RIPEMD

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
How to break MD5 and other hash functions

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

Preimage attacks against PKC98-Hash and HAS-V

ICISC'10 Proceedings of the 13th international conference on Information security and cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this article, we present an improved collision attack on the hash function proposed by Shin et al. at PKC'98. The attack has a complexity of about 220.5 hash computations, while the previous attack of Chang et al. presented at SAC 2002 has a complexity of about 237.13 hash computations. In the analysis of the hash function we combined existing approaches with recent results in cryptanalysis of hash functions. We show that message-dependent rotations can be exploited to construct collisions. The weak design of the step function facilitates high-probability multi-block collisions.