More Web Proxy on the site http://driver.im/

Article

The Exchange Attack: How to Distinguish Six Rounds of AES with Chosen Plaintexts

Authors:

Navid Ghaedi Bardeh,

Sondre RønjomAuthors Info & Claims

Advances in Cryptology – ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part III

Pages 347 - 370

https://doi.org/10.1007/978-3-030-34618-8_12

Published: 08 December 2019 Publication History

Abstract

In this paper we present exchange-equivalence attacks which is a new cryptanalytic attack technique suitable for SPN-like block cipher designs. Our new technique results in the first secret-key chosen plaintext distinguisher for 6-round AES. The complexity of the distinguisher is about in terms of data, memory and computational complexity. The distinguishing attack for AES reduced to six rounds is a straight-forward extension of an exchange attack for 5-round AES that requires in terms of chosen plaintexts and computation. This is also a new record for AES reduced to five rounds. The main result of this paper is that AES up to at least six rounds is biased when restricted to exchange-invariant sets of plaintexts.

References

[1]

Biham, E., Keller, N.: Cryptanalysis of reduced variants of Rijndael. In: 3rd AES Conference, vol. 230 (2000)

[2]

Bouillaguet C, Derbez P, Dunkelman O, Fouque PA, Keller N, and Rijmen V Low-data complexity attacks on AES IEEE Trans. Inf. Theory 2012 58 11 7002-7017

Digital Library

[3]

Daemen J and Rijmen V Plateau characteristics IET Inf. Secur. 2007 1 11-17

[4]

Daemen J and Rijmen V The Design of Rijndael: AES - The Advanced Encryption Standard 2002 Heidelberg Springer

[5]

Daemen J and Rijmen V De Prisco R and Yung M Understanding two-round differentials in AES Security and Cryptography for Networks 2006 Heidelberg Springer 78-94

Digital Library

[6]

Derbez P and Fouque P-A Robshaw M and Katz J Automatic search of meet-in-the-middle and impossible differential attacks Advances in Cryptology – CRYPTO 2016 2016 Heidelberg Springer 157-184

Digital Library

[7]

Grassi L Mixture differential cryptanalysis: a new approach to distinguishers and attacks on round-reduced AES IACR Trans. Symmetric Cryptol. 2018 2018 2 133-160

[8]

Grassi L, Rechberger C, and Rønjom S Subspace trail cryptanalysis and its applications to AES IACR Trans. Symmetric Cryptol. 2016 2016 2 192-225

[9]

Grassi L, Rechberger C, and Rønjom S Coron J-S and Nielsen JB A new structural-differential property of 5-round AES Advances in Cryptology – EUROCRYPT 2017 2017 Cham Springer 289-317

[10]

Gueron S and Mouha N Cheon JH and Takagi T Simpira v2: a family of efficient permutations using the AES round function Advances in Cryptology – ASIACRYPT 2016 2016 Heidelberg Springer 95-125

[11]

Joux A Algorithmic Cryptanalysis 2009 1 Boca Raton Chapman & Hall/CRC

[12]

Knudsen LR and Wagner D Daemen J and Rijmen V Integral cryptanalysis Fast Software Encryption 2002 Heidelberg Springer 112-127

[13]

Rijmen, V.: Cryptanalysis and design of iterated block ciphers. Doctoral dissertation, K.U. Leuven (1997)

[14]

Rønjom S, Bardeh NG, and Helleseth T Takagi T and Peyrin T Yoyo tricks with AES Advances in Cryptology – ASIACRYPT 2017 2017 Cham Springer 217-243

[15]

Sun B, Liu M, Guo J, Qu L, and Rijmen V Robshaw M and Katz J New insights on AES-like SPN ciphers Advances in Cryptology – CRYPTO 2016 2016 Heidelberg Springer 605-624

Digital Library

Cited By

Yan XTan LXu HQi W(2024)Improved mixture differential attacks on 6-round AES-like ciphers towards time and data complexitiesJournal of Information Security and Applications10.1016/j.jisa.2023.10366180:COnline publication date: 17-Apr-2024
https://dl.acm.org/doi/10.1016/j.jisa.2023.103661
List E(2024)Higher-Order Mixture Differentials for AES-Based Block Ciphers and Applications to TweAESAdvances in Information and Computer Security10.1007/978-981-97-7737-2_3(45-64)Online publication date: 17-Sep-2024
https://dl.acm.org/doi/10.1007/978-981-97-7737-2_3
Yan XTan LXu HQi W(2024)The Boomerang Chain Distinguishers: New Record for 6-Round AESAdvances in Cryptology – ASIACRYPT 202410.1007/978-981-96-0941-3_10(301-329)Online publication date: 10-Dec-2024
https://dl.acm.org/doi/10.1007/978-981-96-0941-3_10
Show More Cited By

Recommendations

The (related-key) impossible boomerang attack and its application to the AES block cipher

The Advanced Encryption Standard (AES) is a 128-bit block cipher with a user key of 128, 192 or 256 bits, released by NIST in 2001 as the next-generation data encryption standard for use in the USA. It was adopted as an ISO international standard in ...
Attacking 9 and 10 Rounds of AES-256
ACISP '09: Proceedings of the 14th Australasian Conference on Information Security and Privacy

The AES-256 has received less attention in cryptanalysis than the 192 or 128-bit versions of the AES. In this paper we propose new attacks on 9 and 10-round AES-256. In particular we present a 9-round attack on AES-256 which has the lowest data ...
Improved Meet-in-the-Middle Attacks on Nine Rounds of the AES-192 Block Cipher
Topics in Cryptology – CT-RSA 2024
Abstract
In the single-key attack scenario, meet-in-the-middle (MitM) attack method has led to the best currently published cryptanalytic results on the AES block cipher, except biclique attack. Particularly, for AES with a 192-bit key (AES-192), Li et al. ... $^{}$ $^{}$ $^{}$ $^{}$ $^{}$ $^{}$

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

Advances in Cryptology – ASIACRYPT 2019: 25th International Conference on the Theory and Application of Cryptology and Information Security, Kobe, Japan, December 8–12, 2019, Proceedings, Part III

Dec 2019

765 pages

ISBN:978-3-030-34617-1

DOI:10.1007/978-3-030-34618-8

Editors:
Steven D. Galbraith
University of Auckland, Auckland, New Zealand
,
Shiho Moriai
Security Fundamentals Lab, NICT, Tokyo, Japan

© International Association for Cryptologic Research 2019.

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 08 December 2019

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

5
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 26 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Yan XTan LXu HQi W(2024)Improved mixture differential attacks on 6-round AES-like ciphers towards time and data complexitiesJournal of Information Security and Applications10.1016/j.jisa.2023.10366180:COnline publication date: 17-Apr-2024
https://dl.acm.org/doi/10.1016/j.jisa.2023.103661
List E(2024)Higher-Order Mixture Differentials for AES-Based Block Ciphers and Applications to TweAESAdvances in Information and Computer Security10.1007/978-981-97-7737-2_3(45-64)Online publication date: 17-Sep-2024
https://dl.acm.org/doi/10.1007/978-981-97-7737-2_3
Yan XTan LXu HQi W(2024)The Boomerang Chain Distinguishers: New Record for 6-Round AESAdvances in Cryptology – ASIACRYPT 202410.1007/978-981-96-0941-3_10(301-329)Online publication date: 10-Dec-2024
https://dl.acm.org/doi/10.1007/978-981-96-0941-3_10
Tanaka AShiba RSakamoto KRahman MShiraya TIsobe T(2024)ASURA: An Efficient Large-State Tweakable Block Cipher for ARM EnvironmentProgress in Cryptology – INDOCRYPT 202410.1007/978-3-031-80308-6_7(143-164)Online publication date: 18-Dec-2024
https://dl.acm.org/doi/10.1007/978-3-031-80308-6_7
Bossert JList ELucks SSchmitz S(2022)Pholkos – Efficient Large-State Tweakable Block Ciphers from the AES Round FunctionTopics in Cryptology – CT-RSA 202210.1007/978-3-030-95312-6_21(511-536)Online publication date: 7-Feb-2022
https://dl.acm.org/doi/10.1007/978-3-030-95312-6_21

View Options

View options

Figures

Tables

Media

View Table of Conten