Open Access Open Access  Restricted Access Subscription or Fee Access

Division Algorithm to Search for Monic Irreducible Polynomials Over Extended Galois Field GF(pq)

Sankhanil Dey, Ranjan Ghosh

Abstract



In modern era of computer science there are many applications of the polynomials over finite fields especially of the polynomials over extended Galois fields GF(pq) where p is the prime modulus and q is the extension of the said Galois field, in the generation of the modern algorithms in the computer science, the soft computation, the cryptology and the cryptanalysis and especially in generation of the S-boxes of the cryptographic block and stream ciphers. The procedure and the algorithms of the subtraction and the division of the two Galois field polynomials over the Galois field GF(pq) was remained untouched to the researchers of the applications of finite field theory in the computer science. In this paper the procedure and algorithms to subtract and divide the two Galois field polynomials over Galois field GF(pq) or the two Galois field numbers over the Galois field GF(pq) are introduced in detail. If a monic basic polynomial over the Galois field GF(pq) (BP) [1] is divisible by any of the monic elemental polynomials over the Galois field GF(pq) (EP) [1] except the constant polynomials (CPs) [1] over the Galois field GF(pq) then the monic BP over the Galois field GF(pq) is termed as the monic reducible polynomial (RP) [1] over the Galois field GF(pq) and if a monic BP over the Galois field GF(pq) is not divisible to any of the EPs over the Galois field GF(pq) except the CPs over the Galois field GF(pq) or more specifically to any monic EP over the Galois field GF(pq) with half of the degree of the concerned monic BP over the Galois field GF(pq) then the monic BP over Galois field GF(pq) is called as the irreducible polynomial (IP) [1] over the Galois field GF(pq). Here the common algorithm to generate all the monic IPs over the Galois field GF(pq) is introduced. The time complexity analyses of the algorithms prove the said algorithms to be less time consuming and efficient.

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.