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
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
Collision search attack for 53-step HAS-160
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
Finding collision on 45-step HAS-160
ICISC'05 Proceedings of the 8th international conference on Information Security and Cryptology
A Preimage Attack for 52-Step HAS-160
Information Security and Cryptology --- ICISC 2008
Related-Key Rectangle Attack of the Full HAS-160 Encryption Mode
INDOCRYPT '09 Proceedings of the 10th International Conference on Cryptology in India: Progress in Cryptology
Improved preimage attack for 68-step HAS-160
ICISC'09 Proceedings of the 12th international conference on Information security and cryptology
Cryptanalysis of round-reduced HAS-160
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
HAS-160 is an iterated cryptographic hash function that is widely used in Korea. In this article, we present a collision attack on the hash function HAS-160 reduced to 53-steps. The attack has a complexity of about 235 hash computations. It is based on the work of Cho et al. presented at ICISC 2006. We improve the attack complexity of Cho et al. by a factor of about 220 using a slightly different strategy for message modification in the first 20 steps of the hash function and present the first actual colliding message pair for 53-step HAS-160. Furthermore, we show how the attack can be extended to 59-step HAS-160 by using a characteristic spanning over two message blocks.