Construction of highly nonlinear S-boxes for degree 8 primitive irreducible polynomials over ℤ2

Abstract

Over binary filed F2 there are 16 primitive irreducible polynomials of degree 8, and hence one can construct 16 Galois field extensions of order 256. In this paper, we provide a novel technique to design 16 different robust 8 × 8 substitution boxes (S-boxes) over the elements these 16 Galois fields. For the purpose, on these Galois fields we define 16 linear fractional transformations as: z ⟼ (az + b)/(cz + d), where z is any arbitrary element in any of Galois fields and a, b, c, d are fixed elements from any Galois field GF(28). Accordingly for fixed parameters a, b, c, d, we obtained 16 distinct S-boxes. The algebraic strength of the proposed S-boxes is analyzed by Nonlinearity test, Strict Avalanche Criterion (SAC), Linear Approximation Probability (LP), Bit Independent Criterion (BIC), and Differential Approximation Probability (DP). As an application, by the majority logic criterion (MLC), entropy, correlation, contrast, energy and homogeneity of a plain image and its encrypted image through newly proposed S-box are assessed. Further, to fix the rank of proposed S-boxes, a comparison of these analyses is given with AES S-box, APA S-box, Residue Prime S-box, Gray S-box, Xyi S-box, Skipjack S-box and S8 AES S-box.