Preimage attacks on reduced steps of ARIRANG and PKC98-hash

Deukjo Hong, Bonwook Koo, Woo Hwan Kim, Daesung Kwon

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

5 Scopus citations

Abstract

In this paper, we present the preimage attacks on step-reduced ARIRANG and PKC98-Hash. Our attacks find the preimages of 35 steps out of 40 steps of ARIRANG and 80 steps out of 96 steps of PKC98-Hash, faster than the brute force attack. We applied recently developed techniques of preimage attack. Our attack for ARIRANG is the improvement of the previous attack, and our attack for PKC98-hash is the first analysis result of its preimage resistance.

Original languageEnglish
Title of host publicationInformation Security and Cryptology - ICISC 2009 - 12th International Conference, Revised Selected Papers
Pages315-331
Number of pages17
DOIs
StatePublished - 2010
Event12th International Conference on Information Security and Cryptology, ICISC 2009 - Seoul, Korea, Republic of
Duration: 2 Dec 20094 Dec 2009

Publication series

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

Conference

Conference12th International Conference on Information Security and Cryptology, ICISC 2009
Country/TerritoryKorea, Republic of
CitySeoul
Period2/12/094/12/09

Keywords

  • ARIRANG
  • Hash Function
  • Meet-in-the-middle
  • PKC98-hash
  • Preimage Attack
  • SHA-3 candidate

Fingerprint

Dive into the research topics of 'Preimage attacks on reduced steps of ARIRANG and PKC98-hash'. Together they form a unique fingerprint.

Cite this