Differentially uniform mappings for cryptography
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Camellia: A 128-Bit Block Cipher Suitable for Multiple Platforms - Design and Analysis
SAC '00 Proceedings of the 7th Annual International Workshop on Selected Areas in Cryptography
On Some Cryptographic Properties of Rijndael
MMM-ACNS '01 Proceedings of the International Workshop on Information Assurance in Computer Networks: Methods, Models, and Architectures for Network Security
Cryptanalysis of Block Ciphers with Probabilistic Non-linear Relations of Low Degree
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Proceedings of the Third International Workshop on Fast Software Encryption
The Interpolation Attack on Block Ciphers
FSE '97 Proceedings of the 4th International Workshop on Fast Software Encryption
On the Interpolation Attacks on Block Ciphers
FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
WAIFI '08 Proceedings of the 2nd international workshop on Arithmetic of Finite Fields
Affine equivalence in the AES round function
Discrete Applied Mathematics
A New S-Box Structure Based on Graph Isomorphism
CIS '09 Proceedings of the 2009 International Conference on Computational Intelligence and Security - Volume 01
Hi-index | 0.89 |
Power mapping based S-boxes, especially those with finite field inversion, have received significant attention by cryptographers. S-boxes designed by finite field inversion provide good cryptographic properties and are used in most ciphers@? design such as Advanced Encryption Standard (AES), Camellia, Shark and others. However, such an S-box consists of a simple algebraic expression, thus the S-box design is completed by adding an affine transformation before the input of the S-box, or after the output of the S-box or both in order to make the overall S-box description more complex in a finite field. In the present study, a new method of computation of the algebraic expression (as a polynomial function over GF(2^8)) of power mapping based S-boxes designed by three different probable cases is described in which the place of the affine transformation differs. The proposed method is compared with the Lagrange interpolation formula with respect to the number of polynomial operations needed. The new method (based on the square-and-multiply technique) is found to reduce time and polynomial operation complexity in the computation of the algebraic expression of S-boxes.