begood Posted May 5, 2010 Report Posted May 5, 2010 Cryptology ePrint Archive: Report 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. Cryptology ePrint Archive: Report 2010/257 Quote