A Novel Construction of Perfect Strict Avalanche Criterion S-box using Simple Irreducible Polynomials

• Published in: Scientific Journal of Informatics Vol. 7; no. 1; pp. 10 - 22
• Main Author: Alamsyah, Alamsyah
• Format: Journal Article
• Language: English
• Published: Jurusan Ilmu Komputer Universitas Negeri Semarang 30-05-2020
• Subjects: algebraic technique; irreducible polynomial; s-box; strict avalanche criterion
• ISSN: 2407-7658; 2460-0040
• DOI: 10.15294/sji.v7i1.24006

An irreducible polynomial is one of the main components in building an S-box with an algebraic technique approach. The selection of the precise irreducible polynomial will determine the quality of the S-box produced. One method for determining good S-box quality is strict avalanche criterion will be perfect if it has a value of 0.5. Unfortunately, in previous studies, the strict avalanche criterion value of the S-box produced still did not reach perfect value. In this paper, we will discuss S-box construction using selected irreducible polynomials. This selection is based on the number of elements of the least amount of irreducible polynomials that make it easier to construct S-box construction. There are 17 irreducible polynomials that meet these criteria. The strict avalanche criterion test results show that the irreducible polynomial p17(x) =x8 + x7 + x6 + x + 1 is the best with a perfect SAC value of 0.5. One indicator that a robust S-box is an ideal strict avalanche criterion value of 0.5