Cryptology ePrint Archive: Report 2009/317

Related-key Cryptanalysis of the Full AES-192 and AES-256

Alex Biryukov and Dmitry Khovratovich

Abstract: In this paper we present two related-key attacks on the full AES. For AES-256 we show the first key recovery attack that works for all the keys and has $2^{99.5}$ time and data complexity, while the recent attack by Biryukov-Khovratovich-Nikolic works for a weak key class and has much higher complexity. The second attack is the first cryptanalysis of the full AES-192. Both our attacks are boomerang attacks, which are based on the recent idea of finding local collisions in block ciphers and enhanced with the boomerang switching techniques to gain free rounds in the middle.

Category / Keywords: secret-key cryptography / AES-256, AES-192, related-key attack, local collisions, boomerang switching

Publication Info: Submitted to a conference.

Date: received 28 Jun 2009, last revised 4 Dec 2009

Contact author: alex biryukov at uni lu

Available format(s): PDF | BibTeX Citation

Note: The attack on AES-256 improved to complexity 2^99.

Version: 20091205:025951 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]