# An Algebraic Interpretation of AES-128

@inproceedings{Toli2004AnAI,
title={An Algebraic Interpretation of AES-128},
author={Ilia Toli and Alberto Zanoni},
booktitle={AES Conference},
year={2004}
}
• Published in AES Conference 10 May 2004
• Mathematics, Computer Science
We analyze an algebraic representation of $\mathcal{AES}$128 as an embedding in $\mathcal{BES}$, due to Murphy and Robshaw. We present two systems of equations S⋆ and K⋆ concerning encryption and key generation processes. After some simple but rather cumbersome substitutions, we should obtain two new systems ${\mathcal{C}}_{1}$ and ${\mathcal{C}}_{2}$. ${\mathcal{C}}_{1}$ has 16 very dense equations of degree up to 255 in each of its 16 variables. With a single pair (p,c), with p a cleartext…
Efficient Multiplication in Finite Fields of Characteristic 3 and 5 for Pairing Based Cryptography
• Computer Science, Mathematics
• 2008
A new equation system for AES is proposed that results in new algebraic attack on reduced AES up to 5 rounds, and even by worst method like guessing the unknowns is faster than the brute force attack.
Algebraic aspects of the advanced encryption standard
• Computer Science, Mathematics
• 2006
This work will examine some algebraic aspects of the AES and consider a number of algebraic techniques that could be used in the analysis of the cipher, and focus on the large, though surprisingly simple, systems of multivariate quadratic equations derived from the encryption operation.
The Interaction between Propositional Satisfiability and Applications in Cryptography and Ramsey Problems
An investigation into general methods for representing small boolean functions is the main presentation, used to translate the small components of the AES, and an upper bound is given on the size of the decision-tree and hitting clause-set representations, which are used at intermediate stages of such translations.
On algebraic and statistical properties of AES-like ciphers
A mixed algebraic-statistical attack is developed using the internal algebraic structure of any AES-like cipher to build an algebraic setting where a related-key (statistical) distinguishing attack can be mounted.
On Some Weak Extensions of AES and BES
• Mathematics, Computer Science
ICICS
• 2004
It is shown that the AES and BES can be embedded in their extensions by restricting these extensions on a given subset, and that these natural extensions are trivially weak by describing a cryptanalysis of them despite it leads to no consequence about the security of AES or BES.
On the internal structure of the advanced encryption standard and two AES-based cryptographic constructions
A five-round algebraic property of the AES cipher is proposed which shows that if one carries out four extra exclusive or operations on four fixed-position bytes in some round, five consecutive rounds of such operations will cancel out all changes made to the intermediate results and the final output of the encryption will not be affected by these changes.
Obtaining and Solving Systems of Equations in Key Variables Only for the Small Variants of AES
• Computer Science, Mathematics
Math. Comput. Sci.
• 2008
This work investigates a system of equations that naturally arises in the AES, and introduces an elimination of all the intermediate variables via normal form reductions, and solves the resulting system in key variables only.
A possible intrinsic weakness of AES and other cryptosystems
• Computer Science, Mathematics
ArXiv
• 2010
This paper uses the algebraic structure of AES-like cipher to construct a cipher embedding where the ciphers may lose their non-linearity, and shows some examples.

## References

SHOWING 1-10 OF 13 REFERENCES
Essential Algebraic Structure within the AES
• Computer Science, Mathematics
CRYPTO
• 2002
A new block cipher is defined, the BES, that uses only simple algebraic operations in GF(28) that can be regarded as being identical to the AES with a restricted message space and key space, thus enabling the AES to be realised solely using simple algebraics operations in one field GF( 28).
Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Computer Science, Mathematics
ASIACRYPT
• 2002
A new criterion for design of S-boxes in block ciphers should not be describable by a system of polynomial equations that is too small or too overdefined, and this is suggested for both Serpent and Rijndael.
Advances in Cryptology — ASIACRYPT 2002
• Yuliang Zheng
• Computer Science
Lecture Notes in Computer Science
• 2002
It is concluded that from a practical standpoint, the security of RSA relies exclusively on the hardness of the relation collection step of the number field sieve.
Advances in Cryptology — CRYPTO 2002
• M. Yung
• Computer Science, Mathematics
Lecture Notes in Computer Science
• 2002
A new block cipher is defined, the BES, that uses only simple algebraic operations in GF (2) that can be regarded as being identical to the AES with a restricted message space and key space, thus enabling the AES to be realised solely using simple algebraics operations in one fieldGF (2).
Cryptography: Theory and Practice,Second Edition
There is increased emphasis on general concepts, but the outstanding features that first made this a bestseller all remain, including its mathematical rigor, numerous examples, pseudocode descriptions of algorithms, and clear, precise explanations.
The Design of Rijndael
• Computer Science
Information Security and Cryptography
• 2002
This volume is the authoritative guide to the Rijndael algorithm and AES and professionals, researchers, and students active or interested in data encryption will find it a valuable source of information and reference.
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
• Mathematics
• 1992
Algebraic Geometry is the study of systems of polynomial equations in one or more variables, asking such questions as: Does the The denominator is taking on this, book interested. This book for
A Simple Algebraic Representation of Rijndael
• Mathematics, Computer Science
Selected Areas in Cryptography
• 2001
We show that there is a very straightforward closed algebraic formula for the Rijndael block cipher. This formula is highly structured and far simpler then algebraic formulations of any other block
Polynomial Reconstruction Based Cryptography
• Computer Science, Mathematics
Selected Areas in Cryptography
• 2001
A short overview of recent works on the problem of Decoding Reed Solomon Codes (aka Polynomial Reconstruction) and the novel applications that were enabled due to this development.
The Design of Rijndael: AES - The Advanced Encryption Standard
• Computer Science
• 2002
The underlying mathematics and the wide trail strategy as the basic design idea are explained in detail and the basics of differential and linear cryptanalysis are reworked.