Full-round differential attack on the original version of the hash function proposed at PKC'98

Donghoon Chang, Jaechul Sung, Soohak Sung, Sangjin Lee, Jongin Lim

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

Shin et al.[4] proposed a new hash function with 160-bit output length at PKC'98. Recently, at FSE 2002, Han et al.[5] cryptanalyzed the hash function proposed at PKC'98 and suggested a method finding a collision pair with probability 2-30, supposing that boolean functions satisfy the SAC(Strict Avalanche Criterion). This paper improves their attack and shows that we can find a collision pair from the original version of the hash function with probability 2-37.13 through the improved method. Furthermore we point out a weakness of the function comes from shift values dependent on message.

Original languageEnglish
Pages (from-to)160-174
Number of pages15
JournalLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume2595
Publication statusPublished - 2003 Dec 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Full-round differential attack on the original version of the hash function proposed at PKC'98'. Together they form a unique fingerprint.

  • Cite this