Abstract
In this paper we consider irreducibility of the polynomial composition of the form, \(\left(x^p-x+\delta_2\right)^n P \left( \frac{x^p-x+\delta_1}{x^p-x+\delta_2}\right)\), over \(\mathbb{F}_q\) under certain conditions. Furthermore, a computationally simple and explicit method of constructing recursive sequences of irreducible polynomials of degree np k : (k = 1,2,3, ⋯ ) over \(\mathbb{F}_q\) is given.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cohen, S.: On irreducible polynomials of certain types in finite fields. Proc. Cambridge Philos. Soc. 66, 335–344 (1969)
Kyuregyan, M.: Recurrent methods for constructing irreducible polynomials over \(\mathbb{F}_q\) of odd characteristics. Finite Fields Appl. 9, 39–58 (2003)
Kyuregyan, M.: Iterated constructions of irreducible polynomials over finite fields with linearly independent roots. Finite Fields Appl. 10, 323–431 (2004)
Kyuregyan, M.: Recurrent methods for constructing irreducible polynomials over \(\mathbb{F}_q\) of odd characteristics II. Finite Fields Appl. 12, 357–378 (2006)
Kyuregyan, M., Kyuregyan, G.: Irreducible Compositions of Polynomials over Finite Fields, Design, Codes and Cryptography (2010), doi:10.1007/s10623-010-9478-5
Lidl, R., Niederreiter, H.: Finite Fields. Cambridge University Press, Cambridge (1987)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland, New York (1977)
Menezes, A., Blake, I.F., Gao, X., Mullin, R.C., Vanstone, S.A., Yaghoobian, T.: Applications of Finite Fields. Kluwer Academic Publishers, Boston (1993)
Menezes, A., Van Oorschoot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Meyn, H.: On the construction of irreducible self-rec iprocal polynomials over finite fields. Appl. Algebrain Eng. Commun. Comput. 1, 43–53 (1990)
Moisio, M.: Kloosterman sums, elliptic curves, and irreducible polynomials with prescribed trace and norm, arXiv:0706.2112v5 [math.NT] (November 21, 2007); Comment: 21 pages; revised version with somewhat more clearer proofs; to appear in Acta Arithmetica
Ree, R.: Proof of a conjecture of S. Chowla. J. Number Theory 3, 210–212 (1971)
Varshamov, R.: A general method of synthesizing irreducible polynomials over Galois fields. Soviet Math. Dokl. 29, 334–336 (1984)
Wan, D.: Generators and irreducible polynomials over finite fields. Math. Comp. 219, 1195–1212 (1997)
Yucas, J.L.: Irreducible polynomials over finite fields with prescribed trace/prescribed constant term. Finite Fields and Their Applications 12, 211–221 (2006)
Yucas, J.L.: Generalized reciprocals, factors of Dickson polynomials and generalized cyclotomic polynomials over finite fields. Finite Fields and Their Applications 13(3), 492–515 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Abrahamyan, S., Kyureghyan, M. (2011). A Recurrent Method for Constructing Irreducible Polynomials over Finite Fields. In: Gerdt, V.P., Koepf, W., Mayr, E.W., Vorozhtsov, E.V. (eds) Computer Algebra in Scientific Computing. CASC 2011. Lecture Notes in Computer Science, vol 6885. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23568-9_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-23568-9_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23567-2
Online ISBN: 978-3-642-23568-9
eBook Packages: Computer ScienceComputer Science (R0)