Abstract
We demonstrate an efficient method for computing a Gröbner basis of a zero-dimensional ideal describing the key-recovery problem from a single plaintext/ciphertext pair for the full AES-128. This Gröbner basis is relative to a degree-lexicographical order. We investigate whether the existence of this Gröbner basis has any security implications for the AES. © International Association for Cryptologic Research 2006.
Author supplied keywords
Cite
CITATION STYLE
Buchmann, J., Pyshkin, A., & Weinmann, R. P. (2006). A zero-dimensional Gröbner basis for AES-128. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4047 LNCS, pp. 78–88). Springer Verlag. https://doi.org/10.1007/11799313_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
