R.P.: A Zero-Dimensional Gröbner Basis for AES-128

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 ba-sis is relative to a degree-lexicographical order. We investigate whether the existence of this Gröbner basis has any security implications for the AES