Cryptanalysis of the LAKE hash family

Alex Biryukov; Praveen Gauravaram; Jian Guo; Dmitry Khovratovich; San Ling; Krystian Matusiewicz; Ivica Nikolić; Josef Pieprzyk; Huaxiong Wang

doi:10.1007/978-3-642-03317-9_10

Cryptanalysis of the LAKE hash family

Alex Biryukov^*, Praveen Gauravaram, Jian Guo, Dmitry Khovratovich, San Ling, Krystian Matusiewicz, Ivica Nikolić, Josef Pieprzyk, Huaxiong Wang

^*Corresponding author for this work

School of Computing

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

4 Citations (Scopus)

Abstract

We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attack uses differences in the chaining values and the block counter and finds collisions with complexity 2³³. The second attack utilizes differences in the chaining values and salt and yields collisions with complexity 2⁴². The final attack uses differences only in the chaining values to yield near-collisions with complexity 2⁹⁹. All our attacks are independent of the number of rounds in the compression function. We illustrate the first two attacks by showing examples of collisions and near-collisions.

Original language	English
Title of host publication	Fast software encryption
Subtitle of host publication	16th International Workshop, FSE 2009, Leuven, Belgium, February 22-25, 2009, Revised Selected Papers
Editors	Orr Dunkelman
Place of Publication	Berlin
Publisher	Springer, Springer Nature
Pages	156-179
Number of pages	24
ISBN (Print)	3642033164, 9783642033162
DOIs	https://doi.org/10.1007/978-3-642-03317-9_10
Publication status	Published - 2009
Event	16th International Workshop on Fast Software Encryption, FSE 2009 - Leuven, Belgium Duration: 22 Feb 2009 → 25 Feb 2009

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	5665 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Other

Other	16th International Workshop on Fast Software Encryption, FSE 2009
Country/Territory	Belgium
City	Leuven
Period	22/02/09 → 25/02/09

Access to Document

10.1007/978-3-642-03317-9_10

Cite this

Biryukov, A., Gauravaram, P., Guo, J., Khovratovich, D., Ling, S., Matusiewicz, K., Nikolić, I., Pieprzyk, J., & Wang, H. (2009). Cryptanalysis of the LAKE hash family. In O. Dunkelman (Ed.), Fast software encryption: 16th International Workshop, FSE 2009, Leuven, Belgium, February 22-25, 2009, Revised Selected Papers (pp. 156-179). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5665 LNCS). Springer, Springer Nature. https://doi.org/10.1007/978-3-642-03317-9_10

Biryukov, Alex ; Gauravaram, Praveen ; Guo, Jian et al. / Cryptanalysis of the LAKE hash family. Fast software encryption: 16th International Workshop, FSE 2009, Leuven, Belgium, February 22-25, 2009, Revised Selected Papers. editor / Orr Dunkelman. Berlin : Springer, Springer Nature, 2009. pp. 156-179 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0629a2ca4c914dbe9675ce8184d14ff7,

title = "Cryptanalysis of the LAKE hash family",

abstract = "We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attack uses differences in the chaining values and the block counter and finds collisions with complexity 233. The second attack utilizes differences in the chaining values and salt and yields collisions with complexity 242. The final attack uses differences only in the chaining values to yield near-collisions with complexity 299. All our attacks are independent of the number of rounds in the compression function. We illustrate the first two attacks by showing examples of collisions and near-collisions.",

author = "Alex Biryukov and Praveen Gauravaram and Jian Guo and Dmitry Khovratovich and San Ling and Krystian Matusiewicz and Ivica Nikoli{\'c} and Josef Pieprzyk and Huaxiong Wang",

year = "2009",

doi = "10.1007/978-3-642-03317-9_10",

language = "English",

isbn = "3642033164",

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

publisher = "Springer, Springer Nature",

pages = "156--179",

editor = "Orr Dunkelman",

booktitle = "Fast software encryption",

address = "United States",

note = "16th International Workshop on Fast Software Encryption, FSE 2009 ; Conference date: 22-02-2009 Through 25-02-2009",

}

Biryukov, A, Gauravaram, P, Guo, J, Khovratovich, D, Ling, S, Matusiewicz, K, Nikolić, I, Pieprzyk, J & Wang, H 2009, Cryptanalysis of the LAKE hash family. in O Dunkelman (ed.), Fast software encryption: 16th International Workshop, FSE 2009, Leuven, Belgium, February 22-25, 2009, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5665 LNCS, Springer, Springer Nature, Berlin, pp. 156-179, 16th International Workshop on Fast Software Encryption, FSE 2009, Leuven, Belgium, 22/02/09. https://doi.org/10.1007/978-3-642-03317-9_10

Cryptanalysis of the LAKE hash family. / Biryukov, Alex; Gauravaram, Praveen; Guo, Jian et al.
Fast software encryption: 16th International Workshop, FSE 2009, Leuven, Belgium, February 22-25, 2009, Revised Selected Papers. ed. / Orr Dunkelman. Berlin: Springer, Springer Nature, 2009. p. 156-179 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5665 LNCS).

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

TY - GEN

T1 - Cryptanalysis of the LAKE hash family

AU - Biryukov, Alex

AU - Gauravaram, Praveen

AU - Guo, Jian

AU - Khovratovich, Dmitry

AU - Ling, San

AU - Matusiewicz, Krystian

AU - Nikolić, Ivica

AU - Pieprzyk, Josef

AU - Wang, Huaxiong

PY - 2009

Y1 - 2009

N2 - We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attack uses differences in the chaining values and the block counter and finds collisions with complexity 233. The second attack utilizes differences in the chaining values and salt and yields collisions with complexity 242. The final attack uses differences only in the chaining values to yield near-collisions with complexity 299. All our attacks are independent of the number of rounds in the compression function. We illustrate the first two attacks by showing examples of collisions and near-collisions.

AB - We analyse the security of the cryptographic hash function LAKE-256 proposed at FSE 2008 by Aumasson, Meier and Phan. By exploiting non-injectivity of some of the building primitives of LAKE, we show three different collision and near-collision attacks on the compression function. The first attack uses differences in the chaining values and the block counter and finds collisions with complexity 233. The second attack utilizes differences in the chaining values and salt and yields collisions with complexity 242. The final attack uses differences only in the chaining values to yield near-collisions with complexity 299. All our attacks are independent of the number of rounds in the compression function. We illustrate the first two attacks by showing examples of collisions and near-collisions.

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

U2 - 10.1007/978-3-642-03317-9_10

DO - 10.1007/978-3-642-03317-9_10

M3 - Conference proceeding contribution

AN - SCOPUS:70350349207

SN - 3642033164

SN - 9783642033162

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

SP - 156

EP - 179

BT - Fast software encryption

A2 - Dunkelman, Orr

PB - Springer, Springer Nature

CY - Berlin

T2 - 16th International Workshop on Fast Software Encryption, FSE 2009

Y2 - 22 February 2009 through 25 February 2009

ER -

Biryukov A, Gauravaram P, Guo J, Khovratovich D, Ling S, Matusiewicz K et al. Cryptanalysis of the LAKE hash family. In Dunkelman O, editor, Fast software encryption: 16th International Workshop, FSE 2009, Leuven, Belgium, February 22-25, 2009, Revised Selected Papers. Berlin: Springer, Springer Nature. 2009. p. 156-179. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-642-03317-9_10

Cryptanalysis of the LAKE hash family

Abstract

Publication series

Other

Access to Document

Other files and links

Fingerprint

Cite this