Finding collision on 45-Step HAS-160

Aaram Yun, Soo Hak Sung, Sangwoo Park, Donghoon Chang, Seokhie Hong, Hong Su Cho

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

HAS-160 is a cryptographic hash function designed and used widely in Korea. While similar in structure to SHA-1, up to now there was no published attack or security analysis of the algorithm. Applying techniques introduced by Wang et al.[1], we have found collision in the first 45 steps of HAS-160, with complexity 212.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages146-155
Number of pages10
Volume3935 LNCS
Publication statusPublished - 2006 Jul 17
Event8th International Conference on Information Security and Cryptology, ICISC 2005 - Seoul, Korea, Republic of
Duration: 2005 Dec 12005 Dec 2

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3935 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other8th International Conference on Information Security and Cryptology, ICISC 2005
CountryKorea, Republic of
CitySeoul
Period05/12/105/12/2

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Biochemistry, Genetics and Molecular Biology(all)
  • Theoretical Computer Science

Cite this

Yun, A., Sung, S. H., Park, S., Chang, D., Hong, S., & Cho, H. S. (2006). Finding collision on 45-Step HAS-160. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3935 LNCS, pp. 146-155). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3935 LNCS).