Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials

Itai Dinur; Orr Dunkelman; Adi Shamir

doi:10.1007/978-3-662-43933-3_12

Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials

Itai Dinur, Orr Dunkelman, Adi Shamir

Department of Computer Science

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

Abstract

On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standard. In this paper we present the first published collision finding attacks on reduced-round versions of Keccak-384 and Keccak-512, providing actual collisions for 3-round versions, and describing an attack which is 2⁴⁵ times faster than birthday attacks for 4-round Keccak-384. For Keccak-256, we increase the number of rounds which can be attacked to 5. All these results are based on a generalized internal differential attack (introduced by Peyrin at Crypto 2010), and use it to map a large number of Keccak inputs into a relatively small subset of possible outputs with a surprisingly large probability. In such a squeeze attack it is easier to find random collisions in the reduced target subset by a standard birthday argument.

Original language	English
Title of host publication	Fast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers
Publisher	Springer Verlag
Pages	219-240
Number of pages	22
ISBN (Print)	9783662439326
DOIs	https://doi.org/10.1007/978-3-662-43933-3_12
State	Published - 2014
Event	20th International Workshop on Fast Software Encryption, FSE 2013 - Singapore, Singapore Duration: 11 Mar 2013 → 13 Mar 2013

Publication series

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

Conference

Conference	20th International Workshop on Fast Software Encryption, FSE 2013
Country/Territory	Singapore
City	Singapore
Period	11/03/13 → 13/03/13

Bibliographical note

Funding Information:
The second author was supported in part by the Israel Science Foundation through grant No. 827/12.

Keywords

Collisions
Cryptanalysis
Hash function
Internal differentials
Keccak
SHA-3
Squeeze attack

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-662-43933-3_12

Cite this

Dinur, I., Dunkelman, O., & Shamir, A. (2014). Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials. In Fast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers (pp. 219-240). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8424 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-662-43933-3_12

Dinur, Itai ; Dunkelman, Orr ; Shamir, Adi. / Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials. Fast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers. Springer Verlag, 2014. pp. 219-240 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{51087629640b4c00ba5d8fd39d21551a,

title = "Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials",

abstract = "On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standard. In this paper we present the first published collision finding attacks on reduced-round versions of Keccak-384 and Keccak-512, providing actual collisions for 3-round versions, and describing an attack which is 245 times faster than birthday attacks for 4-round Keccak-384. For Keccak-256, we increase the number of rounds which can be attacked to 5. All these results are based on a generalized internal differential attack (introduced by Peyrin at Crypto 2010), and use it to map a large number of Keccak inputs into a relatively small subset of possible outputs with a surprisingly large probability. In such a squeeze attack it is easier to find random collisions in the reduced target subset by a standard birthday argument.",

keywords = "Collisions, Cryptanalysis, Hash function, Internal differentials, Keccak, SHA-3, Squeeze attack",

author = "Itai Dinur and Orr Dunkelman and Adi Shamir",

note = "Funding Information: The second author was supported in part by the Israel Science Foundation through grant No. 827/12. ; 20th International Workshop on Fast Software Encryption, FSE 2013 ; Conference date: 11-03-2013 Through 13-03-2013",

year = "2014",

doi = "10.1007/978-3-662-43933-3_12",

language = "English",

isbn = "9783662439326",

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

publisher = "Springer Verlag",

pages = "219--240",

booktitle = "Fast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers",

address = "Germany",

}

Dinur, I, Dunkelman, O & Shamir, A 2014, Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials. in Fast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 8424 LNCS, Springer Verlag, pp. 219-240, 20th International Workshop on Fast Software Encryption, FSE 2013, Singapore, Singapore, 11/03/13. https://doi.org/10.1007/978-3-662-43933-3_12

Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials. / Dinur, Itai; Dunkelman, Orr; Shamir, Adi.
Fast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers. Springer Verlag, 2014. p. 219-240 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8424 LNCS).

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

TY - GEN

T1 - Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials

AU - Dinur, Itai

AU - Dunkelman, Orr

AU - Shamir, Adi

N1 - Funding Information: The second author was supported in part by the Israel Science Foundation through grant No. 827/12.

PY - 2014

Y1 - 2014

N2 - On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standard. In this paper we present the first published collision finding attacks on reduced-round versions of Keccak-384 and Keccak-512, providing actual collisions for 3-round versions, and describing an attack which is 245 times faster than birthday attacks for 4-round Keccak-384. For Keccak-256, we increase the number of rounds which can be attacked to 5. All these results are based on a generalized internal differential attack (introduced by Peyrin at Crypto 2010), and use it to map a large number of Keccak inputs into a relatively small subset of possible outputs with a surprisingly large probability. In such a squeeze attack it is easier to find random collisions in the reduced target subset by a standard birthday argument.

AB - On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standard. In this paper we present the first published collision finding attacks on reduced-round versions of Keccak-384 and Keccak-512, providing actual collisions for 3-round versions, and describing an attack which is 245 times faster than birthday attacks for 4-round Keccak-384. For Keccak-256, we increase the number of rounds which can be attacked to 5. All these results are based on a generalized internal differential attack (introduced by Peyrin at Crypto 2010), and use it to map a large number of Keccak inputs into a relatively small subset of possible outputs with a surprisingly large probability. In such a squeeze attack it is easier to find random collisions in the reduced target subset by a standard birthday argument.

KW - Collisions

KW - Cryptanalysis

KW - Hash function

KW - Internal differentials

KW - Keccak

KW - SHA-3

KW - Squeeze attack

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

U2 - 10.1007/978-3-662-43933-3_12

DO - 10.1007/978-3-662-43933-3_12

M3 - Conference contribution

AN - SCOPUS:84905395144

SN - 9783662439326

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

SP - 219

EP - 240

BT - Fast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers

PB - Springer Verlag

T2 - 20th International Workshop on Fast Software Encryption, FSE 2013

Y2 - 11 March 2013 through 13 March 2013

ER -

Dinur I, Dunkelman O, Shamir A. Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials. In Fast Software Encryption - 20th International Workshop, FSE 2013, Revised Selected Papers. Springer Verlag. 2014. p. 219-240. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-662-43933-3_12

Collision attacks on up to 5 rounds of SHA-3 using generalized internal differentials

Abstract

Publication series

Conference

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this