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.