Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard

DOI10.2307/4145212MaRDI QIDQ4469096zbMATH OpenOpenAlexFDO

Authors Susan Landau

Publication date 14 June 2004

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/4145212

zbMATH Keywords

Advanced Encryption StandardAEScryptographyData Encryption StandardDESnonlinearityRijndaelS-BoxSHARKSquare

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to information and communication theory (94-01) Cryptography (94A60)

Recommendations

• scientific article; zbMATH DE number 1952885
• Advanced Encryption Standard – AES
• 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

Cited in

(4)

• NSA and dual EC\_DRBG: Déjà vu all over again?
• NSA's role in the development of DES
• A number system with base \(- \frac{3}{2}\)
• The AES encryption system

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)