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

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 8round 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.

• Type: Conference
• Year: 2006
• Where: CTRSA
• Authors: Eli Biham, Orr Dunkelman, Nathan Keller
• Keywords: Chosen Plaintexts, Cryptology, CTRSA 2006, Data Complexity, Time Complexities