Distinguisher and Related-Key Attack on the Full AES-256

By Alex Biryukov, Dmitry Khovratovich, Ivica Nikolic. Annual International Cryptology Conference, 2009

364 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

LBlock: A Lightweight Block Cipher (2011, background): “Recently, the combination of related-key [2, 17] and traditional cryptanalysis has become one of the most powerful attacks, and its application to some ciphers has improved the cryptanalytic results significantly [4, 6–8, 13].”
The PHOTON Family of Lightweight Hash Functions (2011, background): “Moreover, note that the permutations we will design are fixed-key, so we naturally get rid of related-key attacks or any issue that might arise from the construction of a key-schedule [14, 13].”
A Pragmatic Introduction to Secure Multi-Party Computation (2019, background): “(2015) pointed out that the assumption that fixed-key AES behaves like a random permutation is non-standard and may be questionable in practice (Biryukov et al., 2009; Knudsen and Rijmen, 2007).”
Related-Key Cryptanalysis of the Full AES-192 and AES-256 (2009, background): “We find our boomerang differentials by searching for local collisions [8,6] in a cipher.”
Fast Garbling of Circuits Under Standard Assumptions (2015, background): “Then, the key k 1 is encrypted under the pairs of keys associated with the input values ( 1 , 1 ) , ( 1 , 0 ) , and ( 0 , 1 ) .”