In this paper we examine the strength of AES against the related-key impossible differential attack, following the work of Jakimoski and Desrnedt , 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.
|Number of pages||13|
|Journal||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|State||Published - 2006|
|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
- Impossible differentials
- Related-key differentials