Related-Key Impossible Differential Attacks on 8-Round AES-192

Eli Biham; Orr Dunkelman; N. Keller

Related-Key Impossible Differential Attacks on 8-Round AES-192

Eli Biham, Orr Dunkelman, N. Keller

Department of Mathematics

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

Abstract

In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desmedt [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 288). The time complexities of our attacks is also substantially lower than the time complexities of previous attacks.

Original language	American English
Title of host publication	Topics in Cryptology – CT-RSA 2006
Editors	David Pointcheval
Place of Publication	Berlin Heidelberg
Publisher	Springer
Pages	21-33
Volume	3860
State	Published - 2006

Publication series

Name	Lecture Notes in Computer Science

Cite this

@inbook{29675ea12d914b4fadb95e0fc34f42c7,

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 Desmedt [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 288). The time complexities of our attacks is also substantially lower than the time complexities of previous attacks.",

author = "Eli Biham and Orr Dunkelman and N. Keller",

year = "2006",

language = "American English",

volume = "3860",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "21--33",

editor = "David Pointcheval",

booktitle = "Topics in Cryptology – CT-RSA 2006",

}

TY - CHAP

T1 - Related-Key Impossible Differential Attacks on 8-Round AES-192

AU - Biham, Eli

AU - Dunkelman, Orr

AU - Keller, N.

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 Desmedt [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 288). 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 Desmedt [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 288). The time complexities of our attacks is also substantially lower than the time complexities of previous attacks.

UR - http://link.springer.com/chapter/10.1007/11605805_2

M3 - Chapter

VL - 3860

T3 - Lecture Notes in Computer Science

SP - 21

EP - 33

BT - Topics in Cryptology – CT-RSA 2006

A2 - Pointcheval, David

PB - Springer

CY - Berlin Heidelberg

ER -

Related-Key Impossible Differential Attacks on 8-Round AES-192

Abstract

Publication series

Other files and links

Fingerprint

Cite this