A Simple Algebraic Representation of Rijndael
SAC '01 Revised Papers from the 8th Annual International Workshop on Selected Areas in Cryptography
Essential Algebraic Structure within the AES
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
An Optimized S-Box Circuit Architecture for Low Power AES Design
CHES '02 Revised Papers from the 4th International Workshop on Cryptographic Hardware and Embedded Systems
An AES S-Box to Increase Complexity and Cryptographic Analysis
AINA '05 Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1
Gray S-Box for Advanced Encryption Standard
CIS '08 Proceedings of the 2008 International Conference on Computational Intelligence and Security - Volume 01
A systematic evaluation of compact hardware implementations for the rijndael s-box
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
| Hi-index | 0.09 |
In this paper, we present a method for the construction of 8x8 substitution boxes used in the area of cryptography. A symmetric group permutation S"8 is applied on Galois field elements that originally belong to GF(2^8), and as a consequence, 40320 new substitution boxes are synthesized. The Liu J substitution box is used as a seed in the creation process of the new algebraically complex nonlinear components. The core design of this new algorithm relies on the symmetric group permutation operation which is embedded in the algebraic structure of the new substitution box. We study the characteristics of the newly created substitution boxes and highlight the improved performance parameters and their usefulness in practical applications. In particular, we focus on the nonlinear properties and the behavior of input/output bits and determine the suitability of a particular substitution box for a specific type of encryption application. A comparison with some of the prevailing and popular substitution boxes is presented.