A New S-Box Structure Based on Graph Isomorphism

Abstract

In the original algebraic expression of AES SBox, S-Box is a combination of a power function and an affine surjection. This S-Box provides optimum cryptographic properties. However, the original AES S-Box till has undesired property of simple description in the Galois field GF(2^8). It algebraic expression is spare with only nine non-zero terms which leads to concern of algebraic and interpolation attacks. In this paper, we use graph isomorphism to increase the complexity of algebraic and size of S-Box. The S-Box that is generated by proposed way inherits all good cryptographic characteristics of the original AES S-Box.