Open Access Open Access  Restricted Access Subscription or Fee Access

A new algorithm to search for irreducible polynomials with decimal equivalents of polynomials over Galois field GF(pq)

Sankhanil Dey, Ranjan Ghosh

Abstract



Irreducible polynomials have been of utmost importance in public key cryptography.In this paper a new algorithm to find the decimal equivalents of all monic irreducible polynomials (IPs) over Galois field GF(pq) 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.

Keywords


Irrducible Polynomials, Galois field, Finite field, Algorithms,

Full Text:

PDF


Disclaimer/Regarding indexing issue:

We have provided the online access of all issues and papers to the indexing agencies (as given on journal web site). It’s depend on indexing agencies when, how and what manner they can index or not. Hence, we like to inform that on the basis of earlier indexing, we can’t predict the today or future indexing policy of third party (i.e. indexing agencies) as they have right to discontinue any journal at any time without prior information to the journal. So, please neither sends any question nor expects any answer from us on the behalf of third party i.e. indexing agencies.Hence, we will not issue any certificate or letter for indexing issue. Our role is just to provide the online access to them. So we do properly this and one can visit indexing agencies website to get the authentic information.