Abstract
In this paper, we consider the problem of the simple algebraic structure of the Advanced Encryption Standard (AES) S-box, in which only 9 terms are involved in the algebraic expression, while its inverse S-box involves 255 terms. By resolving the reason why the algebraic expressions of AES-like S-boxes are so simple, the upper bound of items involved in the algebraic expressions of AES-like S-boxes is presented. Then, a new S-box structure named Affine-Power-Affine (APA) is designed such that the algebraic complexity is increased. With the AP A structure, the algebraic complexity of the improved AES S-box is increased from 9 to 253, and its inverse S-box keeps 255. Furthermore, other good cryptographic characteristics of AES S-box are inherited.
| Original language | English |
|---|---|
| Pages (from-to) | 751-759 |
| Number of pages | 9 |
| Journal | International Journal of Innovative Computing, Information and Control |
| Volume | 3 |
| Issue number | 3 |
| Publication status | Published - Jun 2007 |
Keywords
- AES
- APA
- Algebraic complexity
- S-box