Introduction to finite fields and their applications
Introduction to finite fields and their applications
Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Linear cryptanalysis method for DES cipher
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
The Design of Rijndael
In How Many Ways Can You Write Rijndael?
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
The Interpolation Attack on Block Ciphers
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Signal Design for Good Correlation: For Wireless Communication, Cryptography, and Radar
Affine equivalence in the AES round function
Discrete Applied Mathematics
Transform domain analysis of DES
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
In this paper, we propose a simple scheme which produces a new S-box from a given S-box. We use the well-known conversion technique between the polynomial functions over ${\mathbb{F}_{2^n}}$ and the boolean functions from ${\mathbb{F}_2^n}$ to ${\mathbb{F}_2}$. We have applied the scheme to Rijndael S-box and obtained 29 new S-boxes, of which only one is a bijection with better algebraic expression than the original Rijndael S-box and has the same spectral properties as the original Rijndael S-box. All others turned out to be non-bijective, and have different spectral properties, and hence, they all are inequivalent to the original as boolean functions.