Handbook of Applied Cryptography
Handbook of Applied Cryptography
HAS-V: A New Hash Function with Variable Output Length
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
Fast Software Encryption
Preimage Attacks on Step-Reduced MD5
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Preimages for Reduced SHA-0 and SHA-1
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Preimage Attacks on 3, 4, and 5-Pass HAVAL
ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Inversion attacks on secure hash functions using SAT solvers
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Colliding message pair for 53-step HAS-160
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
Weaknesses in the HAS-V compression function
ICISC'07 Proceedings of the 10th international conference on Information security and cryptology
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
Preimage attacks on reduced steps of ARIRANG and PKC98-hash
ICISC'09 Proceedings of the 12th 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
Cryptanalysis of round-reduced HAS-160
ICISC'11 Proceedings of the 14th international conference on Information Security and Cryptology
| Hi-index | 0.00 |
In this paper, we propose preimage attacks on the hash function HAS-160, which is standardized in Korea. We propose two approaches to generate a preimage of step-reduced HAS-160 faster than a brute force attack, which costs 2160. The first approach is a simple application of previously known techniques, which are so-called splice-and-cut ant partial-matching techniques. This approach generates a pseudo-preimage of 48 steps of HAS-160 with a complexity of 2128 and a preimage with a complexity of 2145. In the second approach, we consider a variant of so-called local-collision technique. This approach generates a pseudo-preimage of 52 steps of HAS-160 with a complexity of 2144 and a preimage with a complexity of 2153. To the best of our knowledge, this is the first paper that analyzes the preimage resistance of HAS-160.