Rebound Attack on the Full LANE Compression Function

Krystian Matusiewicz; Maria Naya-Plasencia; Ivica Nikolic; Yu Sasaki; Martin Martin Schlaeffer

doi:10.1007/978-3-642-10366-7_7

Rebound Attack on the Full LANE Compression Function

Krystian Matusiewicz, Maria Naya-Plasencia, Ivica Nikolic, Yu Sasaki, Martin Martin Schlaeffer

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

Abstract

In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 2^96 compression function evaluations and 2^88 memory, and for full Lane-512 with 2^224 compression function evaluations and 2^128 memory.

Original language	English
Title of host publication	Advances in Cryptology -- ASIACRYPT 2009
Editors	Mitsuru Matsui
Number of pages	722
Volume	5912
Publisher	Springer
Publication date	2009
Edition	1
Pages	106-125
ISBN (Print)	978-3-642-10365-0
DOIs	https://doi.org/10.1007/978-3-642-10366-7_7
Publication status	Published - 2009
Event	15th Annual International Conference on the Theory and Application of Cryptology and Information Security - Tokyo, Japan Duration: 6 Dec 2009 → 10 Dec 2009 Conference number: 15 http://asiacrypt2009.cipher.risk.tsukuba.ac.jp/

Conference

Conference	15th Annual International Conference on the Theory and Application of Cryptology and Information Security
Number	15
Country/Territory	Japan
City	Tokyo
Period	06/12/2009 → 10/12/2009
Internet address	http://asiacrypt2009.cipher.risk.tsukuba.ac.jp/

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

Keywords

hash function
cryptanalysis
semi-free-start collision
SHA-3
rebound attack
LANE

Access to Document

10.1007/978-3-642-10366-7_7

http://www.springerlink.com/content/q1867gk784v2mp8q

OpenUrl availability

Full text

Cite this

@inproceedings{5282b1f8dbc74c5cb6cdfe539d204850,

title = "Rebound Attack on the Full LANE Compression Function",

abstract = "In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 2^96 compression function evaluations and 2^88 memory, and for full Lane-512 with 2^224 compression function evaluations and 2^128 memory.",

keywords = "hash function, cryptanalysis, semi-free-start collision, SHA-3, rebound attack, LANE",

author = "Krystian Matusiewicz and Maria Naya-Plasencia and Ivica Nikolic and Yu Sasaki and {Martin Schlaeffer}, Martin",

year = "2009",

doi = "10.1007/978-3-642-10366-7_7",

language = "English",

isbn = "978-3-642-10365-0",

volume = "5912",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

number = "5912",

pages = "106--125",

editor = "Mitsuru Matsui",

booktitle = "Advances in Cryptology -- ASIACRYPT 2009",

edition = "1",

note = "15th Annual International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2009 ; Conference date: 06-12-2009 Through 10-12-2009",

url = "http://asiacrypt2009.cipher.risk.tsukuba.ac.jp/",

}

Matusiewicz, K, Naya-Plasencia, M, Nikolic, I, Sasaki, Y & Martin Schlaeffer, M 2009, Rebound Attack on the Full LANE Compression Function. in M Matsui (ed.), Advances in Cryptology -- ASIACRYPT 2009. 1 edn, vol. 5912, Springer, Lecture Notes in Computer Science, no. 5912, pp. 106-125, 15th Annual International Conference on the Theory and Application of Cryptology and Information Security, Tokyo, Japan, 06/12/2009. https://doi.org/10.1007/978-3-642-10366-7_7

Rebound Attack on the Full LANE Compression Function. / Matusiewicz, Krystian; Naya-Plasencia, Maria; Nikolic, Ivica et al.
Advances in Cryptology -- ASIACRYPT 2009. ed. / Mitsuru Matsui. Vol. 5912 1. ed. Springer, 2009. p. 106-125 (Lecture Notes in Computer Science; No. 5912).

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

TY - GEN

T1 - Rebound Attack on the Full LANE Compression Function

AU - Matusiewicz, Krystian

AU - Naya-Plasencia, Maria

AU - Nikolic, Ivica

AU - Sasaki, Yu

AU - Martin Schlaeffer, Martin

N1 - Conference code: 15

PY - 2009

Y1 - 2009

N2 - In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 2^96 compression function evaluations and 2^88 memory, and for full Lane-512 with 2^224 compression function evaluations and 2^128 memory.

AB - In this work, we apply the rebound attack to the AES based SHA-3 candidate Lane. The hash function Lane uses a permutation based compression function, consisting of a linear message expansion and 6 parallel lanes. In the rebound attack on Lane, we apply several new techniques to construct a collision for the full compression function of Lane-256 and Lane-512. Using a relatively sparse truncated differential path, we are able to solve for a valid message expansion and colliding lanes independently. Additionally, we are able to apply the inbound phase more than once by exploiting the degrees of freedom in the parallel AES states. This allows us to construct semi-free-start collisions for full Lane-256 with 2^96 compression function evaluations and 2^88 memory, and for full Lane-512 with 2^224 compression function evaluations and 2^128 memory.

KW - hash function

KW - cryptanalysis

KW - semi-free-start collision

KW - SHA-3

KW - rebound attack

KW - LANE

U2 - 10.1007/978-3-642-10366-7_7

DO - 10.1007/978-3-642-10366-7_7

M3 - Article in proceedings

SN - 978-3-642-10365-0

VL - 5912

T3 - Lecture Notes in Computer Science

SP - 106

EP - 125

BT - Advances in Cryptology -- ASIACRYPT 2009

A2 - Matsui, Mitsuru

PB - Springer

T2 - 15th Annual International Conference on the Theory and Application of Cryptology and Information Security

Y2 - 6 December 2009 through 10 December 2009

ER -

Rebound Attack on the Full LANE Compression Function

Abstract

Conference

Keywords

Access to Document

OpenUrl availability

Fingerprint

Cite this