Related-key impossible differential attacks on 8-round AES-192

Eli Biharn; Orr Dunkelman; Nathan Keller

Related-key impossible differential attacks on 8-round AES-192

Eli Biharn, Orr Dunkelman, Nathan Keller

Research output: Contribution to journal › Conference article › peer-review

60 Scopus citations

Abstract

In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desrnedt [12], We use several additional observations to substantially improve the data and time complexities of their attacks. Amongst our results, we present a related-key attack on 7-round AES-192 with data complexity of 2⁵⁶ chosen plaintexts (instead of 2¹¹¹), Our attack on 8-round AES-192 has data complexity of 2^68.5 chosen plaintexts (instead of 2 ⁸⁸), The time complexities of our attacks is also substantially lower than the time complexities of previous attacks.

Original language	English
Pages (from-to)	21-33
Number of pages	13
Journal	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3960 LNCS
State	Published - 2006
Externally published	Yes
Event	Topics in Cryptology - CT-RSA 2006: The Cryptographers' Track at the RSA Conference 2006, Proceedings - San Jose, CA, United States Duration: 13 Feb 2005 → 17 Feb 2005

Keywords

AES
Impossible differentials
Related-key differentials

Cite this

@article{980433d7880d433e8277624de17bbe51,

title = "Related-key impossible differential attacks on 8-round AES-192",

abstract = "In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desrnedt [12], We use several additional observations to substantially improve the data and time complexities of their attacks. Amongst our results, we present a related-key attack on 7-round AES-192 with data complexity of 256 chosen plaintexts (instead of 2111), Our attack on 8-round AES-192 has data complexity of 268.5 chosen plaintexts (instead of 2 88), The time complexities of our attacks is also substantially lower than the time complexities of previous attacks.",

keywords = "AES, Impossible differentials, Related-key differentials",

author = "Eli Biharn and Orr Dunkelman and Nathan Keller",

year = "2006",

language = "אנגלית",

volume = "3960 LNCS",

pages = "21--33",

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

issn = "0302-9743",

publisher = "Springer Verlag",

note = "Topics in Cryptology - CT-RSA 2006: The Cryptographers' Track at the RSA Conference 2006, Proceedings ; Conference date: 13-02-2005 Through 17-02-2005",

}

TY - JOUR

T1 - Related-key impossible differential attacks on 8-round AES-192

AU - Biharn, Eli

AU - Dunkelman, Orr

AU - Keller, Nathan

PY - 2006

Y1 - 2006

N2 - In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desrnedt [12], We use several additional observations to substantially improve the data and time complexities of their attacks. Amongst our results, we present a related-key attack on 7-round AES-192 with data complexity of 256 chosen plaintexts (instead of 2111), Our attack on 8-round AES-192 has data complexity of 268.5 chosen plaintexts (instead of 2 88), The time complexities of our attacks is also substantially lower than the time complexities of previous attacks.

AB - In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desrnedt [12], We use several additional observations to substantially improve the data and time complexities of their attacks. Amongst our results, we present a related-key attack on 7-round AES-192 with data complexity of 256 chosen plaintexts (instead of 2111), Our attack on 8-round AES-192 has data complexity of 268.5 chosen plaintexts (instead of 2 88), The time complexities of our attacks is also substantially lower than the time complexities of previous attacks.

KW - AES

KW - Impossible differentials

KW - Related-key differentials

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

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???

AN - SCOPUS:33745642130

SN - 0302-9743

VL - 3960 LNCS

SP - 21

EP - 33

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

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

T2 - Topics in Cryptology - CT-RSA 2006: The Cryptographers' Track at the RSA Conference 2006, Proceedings

Y2 - 13 February 2005 through 17 February 2005

ER -

Related-key impossible differential attacks on 8-round AES-192

Abstract

Keywords

Other files and links

Fingerprint

Cite this