Search for irreducible polynomials over Galois Field GF(pq)

Sankhanil Dey, Ranjan Ghosh


Irreducible polynomials play an important role, till now in construction of 8-bit S-Boxes in ciphers. The 8-bit S-Box of Advanced Encryption Standard is a list of decimal equivalents of Multiplicative Inverses (MI) of all the elemental polynomials of a monic irreducible polynomial over Galois Field GF(28) [1]. In this paper a new method to search for monic Irreducible Polynomials (IPs) over Galois fields GF(pq) has been introduced. Here the decimal equivalents of each monic elemental polynomial (ep), two at a time, are split into the p-nary coefficients of each term, of those two monic elemental polynomials. From those coefficients, the p-nary coefficients of the resultant monic basic polynomials (BP) have been obtained. The decimal equivalents of resultant basic polynomials with p-nary coefficients are treated as decimal equivalents of the monic reducible polynomials, since monic reducible polynomials must have two monic elemental polynomials as its factor. The decimal equivalents of polynomials belonging to the list of reducible polynomials are cancelled leaving behind the monic irreducible polynomials. A non-monic irreducible polynomial is computed by multiplying a monic irreducible polynomial by α where α GF(pq) and assumes values from 2 to (p-1).

Full Text: PDF

How to Cite this Article:

Sankhanil Dey, Ranjan Ghosh, Search for irreducible polynomials over Galois Field GF(pq), Journal of Mathematical and Computational Science, Vol 8, No 1 (2018), 153-180

Copyright © 2018 Sankhanil Dey, Ranjan Ghosh. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

J. Math. Comput. Sci.

ISSN: 1927-5307

Editorial Office:


Copyright ©2018 JMCS