Three months ago A Splice-and-Cut Cryptanalysis of the AES was presented. This attack uses bicliques to recover the key of a reduced-round AES slightly faster than the exhaustive key search. The fact that attacks always get better; they never get worse is emphasized by the new result: Biclique Cryptanalysis of the Full AES. For example, to break all rounds of AES-128, the attack needs 2⁸⁸ data and 2^126.18 time. Although the attack is only about 3 times faster than the worst-case exhaustive search (like, finding a two-digit code after 28 computations instead of trying all 100), and thus does not pose a threat in practice, perhaps it will be a source of inspiration for more practical attacks.

This entry was posted on Thursday, August 18th, 2011 at 11:20 and is filed under Uncategorized. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.