Related-Key Cryptanalysis of the Full AES-192 and AES-256
By Alex Biryukov, Dmitry Khovratovich. International Conference on the Theory and Application of Cryptology and Information Security, 2009
536 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Vision and Pattern Recognition
View Paper: https://www.semanticscholar.org/paper/d7a6f7d5ccee00058d30f590a93082bf49aea743
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Thomas Peyrin
- Jian Guo
- Andrey Bogdanov
- Christian Rechberger
- Wenling Wu
- Lei Zhang
- Axel York Poschmann
- Matthew J. B. Robshaw
In Computer Vision and Pattern Recognition
- Andrey Bogdanov
- Christian Rechberger
- Wenling Wu
- Lei Zhang
- Axel York Poschmann
- Thomas Peyrin
- Jian Guo
- Dmitry Khovratovich
Citations in the corpus
- 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 LED Block Cipher (2011, background): “Our scheme is meant to be resistant to classical attacks, but also to the type of related-key attacks that have been effective against AES-256 [9] and other ciphers [2].”
- 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 [9, 10].”
- Biclique Cryptanalysis of the Full AES (2011, methodology): “Description of AES AES is a block cipher with 128-bit internal state and 128/192/256-bit key K (AES-128, AES-192, AES-256, respectively).”