Construction of 24-by-24 Non-Linear Layer for Symmetric Algorithm and its Application to Data Encryption in Parallel with DNA Transform

Abstract

Abstract Note: Please see pdf for full abstract with equations. The principal constituent of a block cipher in symmetric key cryptography is the Boolean function, determining the substitution box (S-box). Block ciphers rely totally on S-boxes with excellent nonlinearity and upright cryptographic structures. In AES, an 8×8 S-box is a 16×16 look-up table over the Galois field GF(28), that occupies 8 × 28 bytes storage of computer memory. By using traditional method to construct a 24×24 S-box over Galois field GF(224), which lodges a storage memory of 24 × 224 bytes in traditional sense. Thus the memory storage does not support a 24 × 24 S-box over a very larger order Galois field like GF(224). A resolute of this difficulty is possibly coming out from the algebraic structure of the commutative finite chain ring 𝐹𝑞[𝒙] / <𝒙𝒌> = Σ𝑖=0𝑘−1 𝑥𝑖𝐹𝑞. In this study a subgroup of the multiplicative group of units of the chain ring 𝐹2[𝑥] / <𝑥24> = Σ𝑖=023 𝑥𝑖𝐹2 is considered to construct a 24×24 S-box that occupy just 24 ×28 bits storage memory of computer. The proposed S-box has a substantial potential to create confusion during substitution phase of the color image enciphering algorithm. While, for the permutation component of the algorithm, DNA transform is applied for creating diffusion in the pixels of the color image. The proposed RGB image encryption attains the standard optimum level when compared it to the DNA and chaos-based image encryption techniques.