Cryptanalysis of the full HAVAL with 4 and 5 passes

Hongbo Yu; Xiaoyun Wang; Aaram Yun; Sangwoo Park

doi:10.1007/11799313_7

Cryptanalysis of the full HAVAL with 4 and 5 passes

Hongbo Yu, Xiaoyun Wang, Aaram Yun, Sangwoo Park

Department of Cyber Security

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

21 Scopus citations

Abstract

HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992, It has three variants, 3-, 4-, and 5-pass HAVAL, Previous results on HAVAL suggested only practical collision attacks for 3-pass HAVAL, In this paper, we present collision attacks for 4 and 5 pass HAVAL, For 4-pass HAVAL, we describe two practical attacks for finding 2-block collisions, one with 2⁴³ computations and the other with 2³⁶ computations. In addition, we show that collisions for 5-pass HAVAL can be found with about 2¹²³ computations, which is the first attack more efficient than the birthday attack.

Original language	English
Title of host publication	Fast Software Encryption - 13th International Workshop, FSE 2006, Revised Selected Papers
Publisher	Springer Verlag
Pages	89-110
Number of pages	22
ISBN (Print)	3540365974, 9783540365976
DOIs	https://doi.org/10.1007/11799313_7
State	Published - 2006
Event	13th International Workshop on Fast Software Encryption, FSE 2006 - Graz, Austria Duration: 15 Mar 2006 → 17 Mar 2006

Publication series

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

Conference

Conference	13th International Workshop on Fast Software Encryption, FSE 2006
Country/Territory	Austria
City	Graz
Period	15/03/06 → 17/03/06

Keywords

Collision
Differential path
Hash function
Message modification

Access to Document

10.1007/11799313_7

Cite this

Yu, H., Wang, X., Yun, A., & Park, S. (2006). Cryptanalysis of the full HAVAL with 4 and 5 passes. In Fast Software Encryption - 13th International Workshop, FSE 2006, Revised Selected Papers (pp. 89-110). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4047 LNCS). Springer Verlag. https://doi.org/10.1007/11799313_7

@inproceedings{cc400474bb2049bfb9218aeeade02a68,

title = "Cryptanalysis of the full HAVAL with 4 and 5 passes",

abstract = "HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992, It has three variants, 3-, 4-, and 5-pass HAVAL, Previous results on HAVAL suggested only practical collision attacks for 3-pass HAVAL, In this paper, we present collision attacks for 4 and 5 pass HAVAL, For 4-pass HAVAL, we describe two practical attacks for finding 2-block collisions, one with 243 computations and the other with 236 computations. In addition, we show that collisions for 5-pass HAVAL can be found with about 2123 computations, which is the first attack more efficient than the birthday attack.",

keywords = "Collision, Differential path, Hash function, Message modification",

author = "Hongbo Yu and Xiaoyun Wang and Aaram Yun and Sangwoo Park",

year = "2006",

doi = "10.1007/11799313_7",

language = "English",

isbn = "3540365974",

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

publisher = "Springer Verlag",

pages = "89--110",

booktitle = "Fast Software Encryption - 13th International Workshop, FSE 2006, Revised Selected Papers",

note = "13th International Workshop on Fast Software Encryption, FSE 2006 ; Conference date: 15-03-2006 Through 17-03-2006",

}

Yu, H, Wang, X, Yun, A & Park, S 2006, Cryptanalysis of the full HAVAL with 4 and 5 passes. in Fast Software Encryption - 13th International Workshop, FSE 2006, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4047 LNCS, Springer Verlag, pp. 89-110, 13th International Workshop on Fast Software Encryption, FSE 2006, Graz, Austria, 15/03/06. https://doi.org/10.1007/11799313_7

Cryptanalysis of the full HAVAL with 4 and 5 passes. / Yu, Hongbo; Wang, Xiaoyun; Yun, Aaram et al.
Fast Software Encryption - 13th International Workshop, FSE 2006, Revised Selected Papers. Springer Verlag, 2006. p. 89-110 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4047 LNCS).

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

TY - GEN

T1 - Cryptanalysis of the full HAVAL with 4 and 5 passes

AU - Yu, Hongbo

AU - Wang, Xiaoyun

AU - Yun, Aaram

AU - Park, Sangwoo

PY - 2006

Y1 - 2006

N2 - HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992, It has three variants, 3-, 4-, and 5-pass HAVAL, Previous results on HAVAL suggested only practical collision attacks for 3-pass HAVAL, In this paper, we present collision attacks for 4 and 5 pass HAVAL, For 4-pass HAVAL, we describe two practical attacks for finding 2-block collisions, one with 243 computations and the other with 236 computations. In addition, we show that collisions for 5-pass HAVAL can be found with about 2123 computations, which is the first attack more efficient than the birthday attack.

AB - HAVAL is a cryptographic hash function with variable digest size proposed by Zheng, Pieprzyk and Seberry in 1992, It has three variants, 3-, 4-, and 5-pass HAVAL, Previous results on HAVAL suggested only practical collision attacks for 3-pass HAVAL, In this paper, we present collision attacks for 4 and 5 pass HAVAL, For 4-pass HAVAL, we describe two practical attacks for finding 2-block collisions, one with 243 computations and the other with 236 computations. In addition, we show that collisions for 5-pass HAVAL can be found with about 2123 computations, which is the first attack more efficient than the birthday attack.

KW - Collision

KW - Differential path

KW - Hash function

KW - Message modification

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

U2 - 10.1007/11799313_7

DO - 10.1007/11799313_7

M3 - Conference contribution

AN - SCOPUS:33746695391

SN - 3540365974

SN - 9783540365976

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

SP - 89

EP - 110

BT - Fast Software Encryption - 13th International Workshop, FSE 2006, Revised Selected Papers

PB - Springer Verlag

T2 - 13th International Workshop on Fast Software Encryption, FSE 2006

Y2 - 15 March 2006 through 17 March 2006

ER -

Cryptanalysis of the full HAVAL with 4 and 5 passes

Abstract

Publication series

Conference

Keywords

Access to Document

Fingerprint

Cite this