Multiplication over Extended Galois Field: A New Approach to Find Monic Irreducible Polynomials over Galois Field GF(p^q).
Institute of Radio Physics and Electronics, University of Calcutta, Kolkata, West Bengal, India
- Published
- Accepted
- Subject Areas
- Cryptography, Security and Privacy
- Keywords
- Galois Field, Finite Field, Cryptography, Applied Cryptography
- Copyright
- © 2017 Dey et al.
- Licence
- This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, reproduction and adaptation in any medium and for any purpose provided that it is properly attributed. For attribution, the original author(s), title, publication source (PeerJ Preprints) and either DOI or URL of the article must be cited.
- Cite this article
- 2017. Multiplication over Extended Galois Field: A New Approach to Find Monic Irreducible Polynomials over Galois Field GF(p^q). PeerJ Preprints 5:e3258v1 https://doi.org/10.7287/peerj.preprints.3258v1
Abstract
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.
Author Comment
It is an Original Work