Collision search attack for 53-step HAS-160

Hong Su Cho, Sangwoo Park, Soo Hak Sung, Aaram Yun

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations


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.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 2006
Subtitle of host publication9th International Conference, Proceedings
PublisherSpringer Verlag
Number of pages10
ISBN (Print)3540491120, 9783540491125
StatePublished - 2006
EventICISC 2006: 9th International Conference on Information Security and Cryptology - Busan, Korea, Republic of
Duration: 30 Nov 20061 Dec 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4296 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceICISC 2006: 9th International Conference on Information Security and Cryptology
Country/TerritoryKorea, Republic of


  • Collision search attack
  • Cryptanalysis
  • HAS-160
  • Hash function


Dive into the research topics of 'Collision search attack for 53-step HAS-160'. Together they form a unique fingerprint.

Cite this