Cryptology ePrint Archive: Report 2020/360

Composite Algorithm The New Algorithm to Search for Monic Irreducible Polynomials over Extended Galois Fields

Sankhanil Dey and Amlan Chakrabarti and Ranjan Ghosh

Abstract: Irreducible polynomials or IPs have many applications in the field of computer science and information technology. Algorithms in artificial intelligence and substitution boxes in cryptographic ciphers are some evident example of such important applications. But till now the study is mostly limited to the binary Galois field GF prime two and extension q . Some works are there to generate IPs over some non-binary Galois field GF prime p and extension q where p is the prime modulus and p greater than two but the maximum value of p is not more than thirteen and the maximum value of extension q is not more than four. In this paper a new algorithm to search for monic irreducible polynomials over extended Galois field GF prime p and extension q entitled as Composite Algorithm is introduced to computer scientists. Here all possible set of two monic elemental polynomials or EPs one one with highest degree less than equal to q minus one divided by two (for odd value of q) and less than equal to q divided by two (for even value of q) is multiplied over the Galois field GF prime p and extension q to one with highest degree greater than equal to q minus one divided by two (for odd value of q) and greater than q divided by two (for even value of q). All resultant monic polynomials are then divided over the Galois field GF prime p and extension q by a monic basic polynomial or BP one. If for all resultant polynomials the residue is one for a monic BP then the monic BP is termed as monic IP. The time complexity of the said algorithm is prove to be the best among existing such algorithms and efficient of all among them.

Category / Keywords: foundations / Polynomials, Irreducible Polynomials, Algorithms, Numerical Algorithms, Discrete Mathematics in Cryptology, Cryptography

Date: received 26 Mar 2020

Contact author: sdrpe_rs at caluniv ac in

Available format(s): PDF | BibTeX Citation

Note: The study is the stepping stone of the generation of 4 bit, 8 bit and 32 bit S-boxes using irreducible polynomials over extended Galois field with large values of primes and extensions. The study is in review in SADHANA, Academy Proceedings in Engineering Sciences, Indian Academy of science, Springer India.

Version: 20200328:151857 (All versions of this report)

Short URL: ia.cr/2020/360


[ Cryptology ePrint archive ]