Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard
The article tells the story of encryption standardization, from DES to AES. The story starts with the selection process of DES in the 1970s, description of the algorithm and short description of the differential and linear cryptanalysis. Then approaches to S-box design and possible measurements of their nonlinearity are discussed. The article continues with an introduction to Daemen's wide-trade strategy, which Rijndael as well as its predecessors, Shark and Square, are based on. The author describes both Shark and Square, and discusses properties which lead to attacks against these ciphers. Finally, Rijndael is described and objections concerning its security are disputed.
- Some applications of polynomials for the design of cryptographic protocols
- Some algebraic aspects of the advanced encryption standard
- scientific article; zbMATH DE number 3859027
- Algebraic aspects of the advanced encryption standard.
- A POLYNOMIAL DESCRIPTION OF THE RIJNDAEL ADVANCED ENCRYPTION STANDARD
- scientific article; zbMATH DE number 3941423
- An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
- Polynomial structures in code-based cryptography
- Algebraic nonlinearity and its applications to cryptography
This page was built for publication: Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4469096)