TY - GEN
T1 - Improved preimage attack for 68-step HAS-160
AU - Hong, Deukjo
AU - Koo, Bonwook
AU - Sasaki, Yu
PY - 2010
Y1 - 2010
N2 - In this paper, we improve previous preimage attacks on hash function HAS-160, which is standardized in Korea. We show that the last 68 steps out of 80 steps of HAS-160 can be attacked, while a previous attack works for only intermediate 52 steps. We also show that the first 67 steps of HAS-160 can be attacked. These attacks are based on the meet-in-the-middle attack, which is also used in the previous attack. Recently, various techniques of preimage attacks have been proposed on other hash functions. We show that these techniques can also be applied to HAS-160 and the number of attacked steps can be improved. For the attack on 68 steps, we first generate pseudo-preimages with a complexity of 2150.7, and then convert them to a preimage with a complexity of 2156.3. This attack uses a memory of 212 ×7 words. To the best of our knowledge, attacking 68 steps is the best of all attacks on HAS-160 hash function.
AB - In this paper, we improve previous preimage attacks on hash function HAS-160, which is standardized in Korea. We show that the last 68 steps out of 80 steps of HAS-160 can be attacked, while a previous attack works for only intermediate 52 steps. We also show that the first 67 steps of HAS-160 can be attacked. These attacks are based on the meet-in-the-middle attack, which is also used in the previous attack. Recently, various techniques of preimage attacks have been proposed on other hash functions. We show that these techniques can also be applied to HAS-160 and the number of attacked steps can be improved. For the attack on 68 steps, we first generate pseudo-preimages with a complexity of 2150.7, and then convert them to a preimage with a complexity of 2156.3. This attack uses a memory of 212 ×7 words. To the best of our knowledge, attacking 68 steps is the best of all attacks on HAS-160 hash function.
KW - HAS-160
KW - hash function
KW - meet-in-the-middle
KW - preimage
UR - http://www.scopus.com/inward/record.url?scp=77954613537&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-14423-3_22
DO - 10.1007/978-3-642-14423-3_22
M3 - Conference contribution
AN - SCOPUS:77954613537
SN - 3642144225
SN - 9783642144226
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 332
EP - 348
BT - Information Security and Cryptology - ICISC 2009 - 12th International Conference, Revised Selected Papers
T2 - 12th International Conference on Information Security and Cryptology, ICISC 2009
Y2 - 2 December 2009 through 4 December 2009
ER -