Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard (Q4469096)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 2074068
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard |
scientific article; zbMATH DE number 2074068 |
Statements
Polynomials in the Nation's Service: Using Algebra to Design the Advanced Encryption Standard (English)
0 references
14 June 2004
0 references
cryptography
0 references
DES
0 references
Data Encryption Standard
0 references
SHARK
0 references
Square
0 references
Rijndael
0 references
AES
0 references
Advanced Encryption Standard
0 references
S-Box
0 references
nonlinearity
0 references
0.8901981
0 references
0.88369834
0 references
0.86306435
0 references
0.85596645
0 references
0.84123814
0 references
0.83792895
0 references
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.
0 references