Constructing Methods for Irreducible Polynomials
Abstract
In this paper we study the irreducibility of some composite polynomials, constructed with a polynomial composition method over finite fields. Furthermore, a recurrent method for constructing families of irreducible polynomials of higher degree from given irreducible polynomials over finite fields is given.
References
E.R. Berlekamp, Algebraic coding theory, McGraw-Hill, New York, 1968.
I.F. Blake, G. Seroussi, N.P. Smart, Elliptic curves in cryptography, Cambridge University Press, Cambridge, reprinted 2000.
J. Calment, “Algebraic algorithms in GF(q)", Discrete Math., vol. 56, pp. 101-109, 1985.
B. Chor, R. Rivest, “Aknapsack-type public key cryptosystem based on arithmetic in finite fields", IEEE Trans. Inform. Theory, vol. 34, pp. 901-909, 1988.
S.D. Cohen, “On irreducible polynomials of certain types in finite fields", Pros. Cambridge philos. Soc, vol. 66, pp. 335-344, 1969.
S.D. Cohen, “The explicit construction of irreducible polynomial over finite fields", Des. Codes cryptogr., vol. 2, pp. 169-174, 1992.
N. Koblitz, Algebraic aspects of cryptography, Springer, Berlin 1998.
R. Lidl, H. Niederreiter, Finite fields, Cambridge University, Press Cambridge 1987.
M. Kyuregyan, “Recurrent methods for constructing irreducible polynomials over GF(2s)", Finite fields and their applications, vol. 8, pp. 52-68, 2002.
M.K. Kyuregyan, “Iterated constructions of irreducible polynomials over finite fields with linearly independent roots", Finite fields and their applications, vol. 10, pp. 323-341, 2004.
A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullin, S.A. Vanstone, T. Yaghoobian, Applications of finite fields, Kluwer Academic publishers, Boston, 1993.
Downloads
Published
How to Cite
Issue
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
