Multiplication over Extended Galois Field: A New Approach to Find Monic Irreducible Polynomials over Galois Field GF(p^q).
Sankhanil Dey, Ranjan Ghosh · 2017
Searching for Monic Irreducible Polynomials (IPs) over extended Galois Field GF(p^q) for large value of prime moduli p and extension to Galois Field q is a well needed solution in the field of Cryptography. In this paper a new algorithm to obtain Monic IPs over extended Galois Fields GF(p^q) for large value of p and q has been introduced. The algorithm has been based on Multiplication algorithm over Galois Field GF(p^q).Time complexity analysis of the said algorithm has also been executed that ensures the algorithm to be less time consuming.