Search for Monic Irreducible Polynomials with Decimal Equivalents of Polynomials over Galois Field <I>GF</I>(<I>p^q</I>)

Abstract

Substitution boxes or S-boxes play a significant role in encryption and de-cryption of bit level plaintext and cipher-text respectively. Irreducible Poly-nomials (IPs) have been used to construct 4-bit or 8-bit substitution boxes in many cryptographic block ciphers. In Advance Encryption Standard, the ele-ments of 8-bit S-box have been obtained from the Multiplicative Inverse (MI) of elemental polynomials (EPs) of the 1 st IP over Galois field GF (2 8 ) by adding an additive element. In this paper, a mathematical method and the algorithm of the said method with the discussion of the execution time of the algorithm, to obtain monic IPs over Galois field GF ( p q ) have been illustrated with example. The method is very similar to polynomial multiplication of two polynomials over Galois field GF ( p q ) but has a difference in execution. The decimal equivalents of polynomials have been used to identify Basic Polynomials (BPs), EPs, IPs and Reducible polynomials (RPs). The monic RPs have been determined by this method and have been cancelled out to produce monic IPs. The non-monic IPs have been obtained with multiplication of α where α∈ GF ( p q ) and assume values from 2 to ( p &#8722; 1) to monic IPs.