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

Donghoon Chang, Jaechul Sung, Soohak Sung, Sangjin Lee, Jong In 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

Fingerprint

Protein Kinase C
Hash functions
Hash Function
Attack
Avalanches
Collision
Boolean functions
Avalanche
Boolean Functions
Dependent
Output

ASJC Scopus subject areas

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

Cite this

@article{a0c03f19f71549d3b51f575e747a1242,
title = "Full-round differential attack on the original version of the hash function proposed at PKC'98",
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.",
author = "Donghoon Chang and Jaechul Sung and Soohak Sung and Sangjin Lee and Lim, {Jong In}",
year = "2003",
month = "12",
day = "1",
language = "English",
volume = "2595",
pages = "160--174",
journal = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
issn = "0302-9743",
publisher = "Springer Verlag",

}

TY - JOUR

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

AU - Chang, Donghoon

AU - Sung, Jaechul

AU - Sung, Soohak

AU - Lee, Sangjin

AU - Lim, Jong In

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=35248853484&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248853484&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:35248853484

VL - 2595

SP - 160

EP - 174

JO - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

JF - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SN - 0302-9743

ER -