Improved key recovery attacks on reduced-round aes with practical data and memory complexities

Achiya Bar-On; Orr Dunkelman; Nathan Keller; Eyal Ronen; Adi Shamir

doi:10.1007/978-3-319-96881-0_7

Improved key recovery attacks on reduced-round aes with practical data and memory complexities

Achiya Bar-On, Orr Dunkelman, Nathan Keller, Eyal Ronen, Adi Shamir

Department of Computer Science

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

Abstract

Determining the security of AES is a central problem in cryptanalysis, but progress in this area had been slow and only a handful of cryptanalytic techniques led to significant advancements. At Eurocrypt 2017 Grassi et al. presented a novel type of distinguisher for AES-like structures, but so far all the published attacks which were based on this distinguisher were inferior to previously known attacks in their complexity. In this paper we combine the technique of Grassi et al. with several other techniques to obtain the best known key recovery attack on 5-round AES in the single-key model, reducing its overall complexity from about (FORMULA PRESENTED) to about (FORMULA PRESENTED). Extending our techniques to 7-round AES, we obtain the best known attacks on AES-192 which use practical amounts of data and memory, breaking the record for such attacks which was obtained 18 years ago by the classical Square attack.

Original language	English
Title of host publication	Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings
Editors	Alexandra Boldyreva, Hovav Shacham
Publisher	Springer Verlag
Pages	185-212
Number of pages	28
ISBN (Print)	9783319968803
DOIs	https://doi.org/10.1007/978-3-319-96881-0_7
State	Published - 2018
Event	38th Annual International Cryptology Conference, CRYPTO 2018 - Santa Barbara, United States Duration: 19 Aug 2018 → 23 Aug 2018

Publication series

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

Conference

Conference	38th Annual International Cryptology Conference, CRYPTO 2018
Country/Territory	United States
City	Santa Barbara
Period	19/08/18 → 23/08/18

Bibliographical note

Publisher Copyright:
© 2018, International Association for Cryptologic Research.

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/978-3-319-96881-0_7

Cite this

Bar-On, A., Dunkelman, O., Keller, N., Ronen, E., & Shamir, A. (2018). Improved key recovery attacks on reduced-round aes with practical data and memory complexities. In A. Boldyreva, & H. Shacham (Eds.), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (pp. 185-212). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10992 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-96881-0_7

Bar-On, Achiya ; Dunkelman, Orr ; Keller, Nathan et al. / Improved key recovery attacks on reduced-round aes with practical data and memory complexities. Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. editor / Alexandra Boldyreva ; Hovav Shacham. Springer Verlag, 2018. pp. 185-212 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{56b183e00b3c4d5da31bcee52e3e99b6,

title = "Improved key recovery attacks on reduced-round aes with practical data and memory complexities",

abstract = "Determining the security of AES is a central problem in cryptanalysis, but progress in this area had been slow and only a handful of cryptanalytic techniques led to significant advancements. At Eurocrypt 2017 Grassi et al. presented a novel type of distinguisher for AES-like structures, but so far all the published attacks which were based on this distinguisher were inferior to previously known attacks in their complexity. In this paper we combine the technique of Grassi et al. with several other techniques to obtain the best known key recovery attack on 5-round AES in the single-key model, reducing its overall complexity from about (FORMULA PRESENTED) to about (FORMULA PRESENTED). Extending our techniques to 7-round AES, we obtain the best known attacks on AES-192 which use practical amounts of data and memory, breaking the record for such attacks which was obtained 18 years ago by the classical Square attack.",

author = "Achiya Bar-On and Orr Dunkelman and Nathan Keller and Eyal Ronen and Adi Shamir",

note = "Publisher Copyright: {\textcopyright} 2018, International Association for Cryptologic Research.; 38th Annual International Cryptology Conference, CRYPTO 2018 ; Conference date: 19-08-2018 Through 23-08-2018",

year = "2018",

doi = "10.1007/978-3-319-96881-0_7",

language = "English",

isbn = "9783319968803",

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

publisher = "Springer Verlag",

pages = "185--212",

editor = "Alexandra Boldyreva and Hovav Shacham",

booktitle = "Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings",

address = "Germany",

}

Bar-On, A, Dunkelman, O, Keller, N, Ronen, E & Shamir, A 2018, Improved key recovery attacks on reduced-round aes with practical data and memory complexities. in A Boldyreva & H Shacham (eds), Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10992 LNCS, Springer Verlag, pp. 185-212, 38th Annual International Cryptology Conference, CRYPTO 2018, Santa Barbara, United States, 19/08/18. https://doi.org/10.1007/978-3-319-96881-0_7

Improved key recovery attacks on reduced-round aes with practical data and memory complexities. / Bar-On, Achiya; Dunkelman, Orr; Keller, Nathan et al.
Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. ed. / Alexandra Boldyreva; Hovav Shacham. Springer Verlag, 2018. p. 185-212 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10992 LNCS).

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

TY - GEN

T1 - Improved key recovery attacks on reduced-round aes with practical data and memory complexities

AU - Bar-On, Achiya

AU - Dunkelman, Orr

AU - Keller, Nathan

AU - Ronen, Eyal

AU - Shamir, Adi

PY - 2018

Y1 - 2018

N2 - Determining the security of AES is a central problem in cryptanalysis, but progress in this area had been slow and only a handful of cryptanalytic techniques led to significant advancements. At Eurocrypt 2017 Grassi et al. presented a novel type of distinguisher for AES-like structures, but so far all the published attacks which were based on this distinguisher were inferior to previously known attacks in their complexity. In this paper we combine the technique of Grassi et al. with several other techniques to obtain the best known key recovery attack on 5-round AES in the single-key model, reducing its overall complexity from about (FORMULA PRESENTED) to about (FORMULA PRESENTED). Extending our techniques to 7-round AES, we obtain the best known attacks on AES-192 which use practical amounts of data and memory, breaking the record for such attacks which was obtained 18 years ago by the classical Square attack.

AB - Determining the security of AES is a central problem in cryptanalysis, but progress in this area had been slow and only a handful of cryptanalytic techniques led to significant advancements. At Eurocrypt 2017 Grassi et al. presented a novel type of distinguisher for AES-like structures, but so far all the published attacks which were based on this distinguisher were inferior to previously known attacks in their complexity. In this paper we combine the technique of Grassi et al. with several other techniques to obtain the best known key recovery attack on 5-round AES in the single-key model, reducing its overall complexity from about (FORMULA PRESENTED) to about (FORMULA PRESENTED). Extending our techniques to 7-round AES, we obtain the best known attacks on AES-192 which use practical amounts of data and memory, breaking the record for such attacks which was obtained 18 years ago by the classical Square attack.

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

U2 - 10.1007/978-3-319-96881-0_7

DO - 10.1007/978-3-319-96881-0_7

M3 - Conference contribution

AN - SCOPUS:85052394374

SN - 9783319968803

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

SP - 185

EP - 212

BT - Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings

A2 - Boldyreva, Alexandra

A2 - Shacham, Hovav

PB - Springer Verlag

T2 - 38th Annual International Cryptology Conference, CRYPTO 2018

Y2 - 19 August 2018 through 23 August 2018

ER -

Bar-On A, Dunkelman O, Keller N, Ronen E, Shamir A. Improved key recovery attacks on reduced-round aes with practical data and memory complexities. In Boldyreva A, Shacham H, editors, Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings. Springer Verlag. 2018. p. 185-212. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/978-3-319-96881-0_7

Improved key recovery attacks on reduced-round aes with practical data and memory complexities

Abstract

Publication series

Conference

Bibliographical note

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this