Cryptanalysis of round-reduced HAS-160

Authors:
Florian Mendel;Tomislav Nad;Martin Schläffer
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'11 Proceedings of the 14th international conference on Information Security and Cryptology
Year:
2011

Citing 17
Cited 1

Differential cryptanalysis of hash functions based on block ciphers

CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Differential Collisions in SHA-0

CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
A Preimage Attack for 52-Step HAS-160

Information Security and Cryptology --- ICISC 2008
Practical Collisions for EnRUPT

Fast Software Encryption
A Distinguisher for the Compression Function of SIMD-512

INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Colliding message pair for 53-step HAS-160

ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Improved preimage attack for 68-step HAS-160

ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Finding SHA-1 characteristics: general results and applications

ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Update on SHA-1

CT-RSA'05 Proceedings of the 2005 international conference on Topics 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
Collision search attack for 53-step HAS-160

ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Exploiting coding theory for collision attacks on SHA-1

IMA'05 Proceedings of the 10th international conference on Cryptography and Coding
Finding collision on 45-step HAS-160

ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
Finding SHA-2 characteristics: searching through a minefield of contradictions

ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511

IEEE Transactions on Information Theory

Finding collisions for round-reduced SM3

CT-RSA'13 Proceedings of the 13th international conference on Topics in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

HAS-160 is an iterated cryptographic hash function that is standardized by the Korean government and widely used in Korea. In this paper, we present a semi-free-start collision for 65 (out of 80) steps of HAS-160 with practical complexity. The basic attack strategy is to construct a long differential characteristic by connecting two short ones by a complex third characteristic. The short characteristics are constructed using techniques from coding theory. To connect them, we are using an automatic search algorithm for the connecting characteristic utilizing the nonlinearity of the step function.