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

doi:10.1007/3-540-36492-7_12

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

Department of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

4 Scopus citations

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 language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Editors	Kaisa Nyberg, Howard Heys
Publisher	Springer Verlag
Pages	160-174
Number of pages	15
ISBN (Print)	9783540006220
DOIs	https://doi.org/10.1007/3-540-36492-7_12
State	Published - 2003

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	2595
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Access to Document

10.1007/3-540-36492-7_12

Cite this

Chang, D., Sung, J., Sung, S., Lee, S., & Lim, J. (2003). Full-round differential attack on the original version of the hash function proposed at PKC'98. In K. Nyberg, & H. Heys (Eds.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 160-174). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2595). Springer Verlag. https://doi.org/10.1007/3-540-36492-7_12

Chang, Donghoon ; Sung, Jaechul ; Sung, Soohak et al. / Full-round differential attack on the original version of the hash function proposed at PKC'98. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). editor / Kaisa Nyberg ; Howard Heys. Springer Verlag, 2003. pp. 160-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inbook{56c1ae3d5d224245bdd574b3067a060d,

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 Jongin Lim",

year = "2003",

doi = "10.1007/3-540-36492-7_12",

language = "English",

isbn = "9783540006220",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "160--174",

editor = "Kaisa Nyberg and Howard Heys",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

address = "Germany",

}

Chang, D, Sung, J, Sung, S, Lee, S & Lim, J 2003, Full-round differential attack on the original version of the hash function proposed at PKC'98. in K Nyberg & H Heys (eds), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2595, Springer Verlag, pp. 160-174. https://doi.org/10.1007/3-540-36492-7_12

Full-round differential attack on the original version of the hash function proposed at PKC'98. / Chang, Donghoon; Sung, Jaechul; Sung, Soohak et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). ed. / Kaisa Nyberg; Howard Heys. Springer Verlag, 2003. p. 160-174 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2595).

Research output: Chapter in Book/Report/Conference proceeding › Chapter › peer-review

TY - CHAP

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, Jongin

PY - 2003

Y1 - 2003

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

U2 - 10.1007/3-540-36492-7_12

DO - 10.1007/3-540-36492-7_12

M3 - Chapter

AN - SCOPUS:35248853484

SN - 9783540006220

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

SP - 160

EP - 174

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

A2 - Nyberg, Kaisa

A2 - Heys, Howard

PB - Springer Verlag

ER -

Chang D, Sung J, Sung S, Lee S, Lim J. Full-round differential attack on the original version of the hash function proposed at PKC'98. In Nyberg K, Heys H, editors, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. 2003. p. 160-174. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-36492-7_12

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

Abstract

Publication series

Access to Document

Other files and links

Fingerprint

Cite this