Collision Search Attack for 53-Step HAS-160

HAS-160 is a cryptographic hash function which is designed and used widely in Korea. In ICISC 2005, Yun et al. presented a collision search attack for the first 45 steps of HAS-160. In this paper, we extend the result to the first 53 steps of HAS-160. The time complexity of the attack is about 255.

Saved in:
Bibliographic Details
Published inInformation Security and Cryptology – ICISC 2006 pp. 286 - 295
Main Authors Cho, Hong-Su, Park, Sangwoo, Sung, Soo Hak, Yun, Aaram
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
collision search attack
Computer science; control theory; systems
cryptanalysis
Cryptography
Exact sciences and technology
HAS-160
hash function
Information, signal and communications theory
Memory and file management (including protection and security)
Memory organisation. Data processing
Signal and communications theory
Software
Telecommunications and information theory
Asia
Korea
Collision
Cryptanalysis
Hashing
Cryptography
Time complexity
Computer security
Computer attack
Online AccessGet more information

Cover

More Information
Summary:HAS-160 is a cryptographic hash function which is designed and used widely in Korea. In ICISC 2005, Yun et al. presented a collision search attack for the first 45 steps of HAS-160. In this paper, we extend the result to the first 53 steps of HAS-160. The time complexity of the attack is about 255.
ISBN:9783540491125
3540491120
ISSN:0302-9743
1611-3349
DOI:10.1007/11927587_24