Sankhanil Dey and Ranjan Ghosh
A New Algorithm to Search for Irreducible Polynomials Using Decimal Equivalents.
(345K, PDF)

ABSTRACT.   In this paper a new algorithm to find the decimal equivalents of all monic irreducible polynomials (IPs) over Galois Field GF(p^q) has been introduced. This algorithm is effective to find the decimal equivalents of monic IPs over Galois Field with a large value of prime modulus and also with a large extension of the prime modulus. The algorithm introduced in this paper is much more time effective with less complexity. It is able to find monic irreducible polynomials for a large value of prime modulus and also with large extension of the prime modulus in few seconds.