Feasible Attack on the 13-round AES-256

You are looking at a specific version 20100505:100710 of this paper. See the latest version.

Paper 2010/257

Feasible Attack on the 13-round AES-256

Alex Biryukov and Dmitry Khovratovich

Abstract

In this note we present the first attack with feasible complexity on the 13-round AES-256. The attack runs in the related-subkey scenario with four related keys, in 2^{76} time, data, and memory.

Metadata

Available format(s): PDF
Category: Secret-key cryptography
Publication info: Published elsewhere. Unknown where it was published
Keywords: aes cryptanalysis related keys boomerang attack
Contact author(s): khovratovich @ gmail com
alex cryptan @ gmail com
History: 2010-05-05: received
Short URL: https://ia.cr/2010/257
License: CC BY