Essential Algebraic Structure within the AES

  • Sean Murphy
  • Matthew J.B. Robshaw
Conference paper

DOI: 10.1007/3-540-45708-9_1

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2442)
Cite this paper as:
Murphy S., Robshaw M.J. (2002) Essential Algebraic Structure within the AES. In: Yung M. (eds) Advances in Cryptology — CRYPTO 2002. CRYPTO 2002. Lecture Notes in Computer Science, vol 2442. Springer, Berlin, Heidelberg


One difficulty in the cryptanalysis of the Advanced Encryption Standard AES is the tension between operations in the two fields GF(28) and GF(2). This paper outlines a new approach that avoids this conflict. We define a new block cipher, the BES, that uses only simple algebraic operations in GF(28). Yet the AES can be regarded as being identical to the BES with a restricted message space and key space, thus enabling the AES to be realised solely using simple algebraic operations in one field GF(28). This permits the exploration of the AES within a broad and rich setting. One consequence is that AES encryption can be described by an extremely sparse overdetermined multivariate quadratic system over GF(28), whose solution would recover an AES key.


Advanced Encryption Standard AES Rijndael BES Algebraic Structure (Finite) Galois Field (Field) Conjugate Multivariate Quadratic (MQ) Equations 

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Sean Murphy
    • 1
  • Matthew J.B. Robshaw
    • 1
  1. 1.Information Security GroupUniversity of LondonEghamUK

Personalised recommendations