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

  • Authors:
  • Eli Biham;Orr Dunkelman;Nathan Keller

  • Affiliations:
  • Computer Science Department, Technion, Haifa, Israel;Computer Science Department, Technion, Haifa, Israel;Einstein Institute of Mathematics, Hebrew University, Jerusalem, Israel

  • Venue:
  • CT-RSA'06 Proceedings of the 2006 The Cryptographers' Track at the RSA conference on Topics in Cryptology
  • Year:
  • 2006

Quantified Score

Hi-index 0.02

Visualization

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.