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

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

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.

Original language	English
Title of host publication	Fast Software Encryption
Editors	Orr Dunkelman
Number of pages	415
Volume	5665
Place of Publication	Berlin / Heidelberg
Publisher	Springer
Publication date	2009
Pages	156-179
DOIs	https://doi.org/10.1007/978-3-642-03317-9_10
Publication status	Published - 2009
Event	Fast Software Encryption 2009 - Leuven, Belgium Duration: 22 Feb 2009 → 25 Feb 2009 Conference number: 16 http://www.informatik.uni-trier.de/~ley/db/conf/fse/fse2009.html

Conference

Conference	Fast Software Encryption 2009
Number	16
Country/Territory	Belgium
City	Leuven
Period	22/02/2009 → 25/02/2009
Internet address	http://www.informatik.uni-trier.de/~ley/db/conf/fse/fse2009.html

Series	Lecture Notes in Computer Science
Number	5665
ISSN	0302-9743

Keywords

cryptanalysis
collision attacks
LAKE hash family

Access to Document

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

http://springerlink.com.globalproxy.cvt.dk/content/c40k5148476l4023/?p=ff4b10e8ea9b44a2bb76a7027f0124c9&pi=5

OpenUrl availability

Full text

Cite this

@inproceedings{6881cca5ba704b3e9214e7af1adaa62f,

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.",

keywords = "cryptanalysis, collision attacks, LAKE hash family",

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

volume = "5665",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "5665",

pages = "156--179",

editor = "Orr Dunkelman",

booktitle = "Fast Software Encryption",

note = "Fast Software Encryption 2009, FSE 2009 ; Conference date: 22-02-2009 Through 25-02-2009",

url = "http://www.informatik.uni-trier.de/~ley/db/conf/fse/fse2009.html",

}

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. vol. 5665, Springer, Berlin / Heidelberg, Lecture Notes in Computer Science, no. 5665, pp. 156-179, Fast Software Encryption 2009, Leuven, Belgium, 22/02/2009. https://doi.org/10.1007/978-3-642-03317-9_10

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

N1 - Conference code: 16

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.

KW - cryptanalysis

KW - collision attacks

KW - LAKE hash family

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

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

M3 - Article in proceedings

VL - 5665

T3 - Lecture Notes in Computer Science

SP - 156

EP - 179

BT - Fast Software Encryption

A2 - Dunkelman, Orr

PB - Springer

CY - Berlin / Heidelberg

T2 - Fast Software Encryption 2009

Y2 - 22 February 2009 through 25 February 2009

ER -

Cryptanalysis of the LAKE Hash Family

Abstract

Conference

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this