Abstract
Let q = p s be a power of a prime number p and let \({\mathbb {F}_{\rm q}}\) be a finite field with q elements. This paper aims to demonstrate the utility and relation of composed products to other areas such as the factorization of cyclotomic polynomials, construction of irreducible polynomials, and linear recurrence sequences over \({\mathbb {F}_{\rm q}}\). In particular we obtain the explicit factorization of the cyclotomic polynomial \({\Phi_{2^nr}}\) over \({\mathbb {F}_{\rm q}}\) where both r ≥ 3 and q are odd, gcd(q, r) = 1, and \({n\in \mathbb{N}}\) . Previously, only the special cases when r = 1, 3, 5, had been achieved. For this we make the assumption that the explicit factorization of \({\Phi_r}\) over \({\mathbb {F}_{\rm q}}\) is given to us as a known. Let \({n = p_1^{e_1}p_2^{e_2}\cdots p_s^{e_s}}\) be the factorization of \({n \in \mathbb{N}}\) into powers of distinct primes p i , 1 ≤ i ≤ s. In the case that the multiplicative orders of q modulo all these prime powers \({p_i^{e_i}}\) are pairwise coprime, we show how to obtain the explicit factors of \({\Phi_{n}}\) from the factors of each \({\Phi_{p_i^{e_i}}}\). We also demonstrate how to obtain the factorization of \({\Phi_{mn}}\) from the factorization of \({\Phi_n}\) when q is a primitive root modulo m and \({{\rm gcd}(m, n) = {\rm gcd}(\phi(m),{\rm ord}_n(q)) = 1.}\) Here \({\phi}\) is the Euler’s totient function, and ord n (q) denotes the multiplicative order of q modulo n. Moreover, we present the construction of a new class of irreducible polynomials over \({\mathbb {F}_{\rm q}}\) and generalize a result due to Varshamov (Soviet Math Dokl 29:334–336, 1984).
Similar content being viewed by others
References
Apostol T.M.: Introduction to analytic number theory. Springer, New York (1976)
Bamunoba A.S.: Cyclotomic polynomials, African institute for mathematical sciences, Stellenbosch University, South Africa. Available at: http://users.aims.ac.za/~bamunoba/bamunoba.pdf (2010).
Berlekamp E.R.: Bit-serial Reed-Solomon Encoders. IEEE Trans. Inf. Theory 28, 869–874 (1982)
Beyl F.R.: Cyclic subgroups of the prime residue group. Am. Math. Monthly 84, 46–68 (1977)
Blake I., Gao S., Mills D.: Factorization of polynomials of the type f (x t). Presented at the International Conference on Finite Fields, Coding Theory, and Advances in Comm. and Computing, Las Vegas (1991).
Brawley J.V., Carlitz L.: Irreducibles and the composed product for polynomials over a finite field. Discret. Math. 65, 115–139 (1987)
Brawley J.V., Gao S., Mills D.: Computing composed products of polynomials. In: Finite fields: theory, applications, and algorithms (Waterloo, ON, 1997), Contemporary Mathematics, 225, pp. 1–15, American Mathematical Society, Providence (1997).
Cohen S.D.: On irreducible polynomials of certain types in finite fields. Proc. Camb. Philos. Soc 66, 335–344 (1969)
Cohen S.D.: Explicit theorems on generator polynomials over finite fields. Finite Fields Appl 11, 337–357 (2005)
Fitzgerald R.W., Yucas J.L.: Factors of Dickson polynomials over finite fields. Finite Fields Appl. 11(4), 724–737 (2005)
Fitzgerald R.W., Yucas J.L.: Explicit factorization of cyclotomic and Dickson polynomials over finite fields. Arithmetic of Finite Fields. Lecture Notes in Computer Science 4547, pp. 1–10. Springer, Berlin, (2007).
Gao Z., Fu F.: The minimal polynomial over \({\mathbb {F}_{\rm q}}\) of linear recurring sequence over \({\mathbb{F}_{q^m}}\) . Finite Fields Appl. 15(6), 774–784 (2009)
Golomb S., Gong G.: Signal design for good correlation: For wireless communication, cryptography, and radar. Cambridge University Press, Cambridge (2005).
Kyuregyan M.K., Kyureghyan G.H.: Irreducible compositions of polynomials over finite fields. Des. Codes Cryptogr. 61(3), 301–314 (2011)
Lidl R., Niederreiter H.: Finite fields, In: Encyclopedia of mathematics and its applications, 2nd edn., vol. 20, Cambridge University Press, Cambridge (1997).
Meyn H.: Factorization of the cyclotomic polynomials x 2^n + 1 over finite fields. Finite Fields Appl. 2, 439–442 (1996)
Mills D.: Factorizations of root-based polynomial compositions. Discret. Math. 240(1–3), 161–173 (2001)
Nicholson W.K.: Introduction to abstract Algebra, 2nd edn., Wiley (1999)
Selmer E.S.: Linear recurrence relations over finite fields. University of Bergen, Norway (1966)
Stein G.: Using the theory of cyclotomy to factor cyclotomic polynomials over finite fields. Math. Comp. 70(235), 1237–1251 (2001)
Sury B.: Cyclotomy and cyclotomic polynomials: The story of how Gauss narrowly missed becoming a philologist. Resonance. 4(12), 41–53 (1999)
Tuxanidy A.: Composed products and factorization of cyclotomic polynomials over finite fields. Honours Project, Carleton University (2011)
Varshamov R.: A general method of synthesizing irreducible polynomials over Galois fields. Soviet Math. Dokl. 29, 334–336 (1984)
Wan Z.: Lectures on finite fields and Galois rings. World Scientific Publishing Co. Pte. Ltd. (2003).
Wang M., Blake I.F.: Bit-serial multiplication in finite fields. IEEE Trans. Comput. 38, 1457–1460 (1989)
Wang L., Wang Q.: On explicit factors of cyclotomic polynomials over finite fields. Des. Codes Cryptogr. 63, 87–104 (2011)
Washington L.C.: Introduction to cyclotomic fields. Springer, New York (1982)
Zierler N., Mills W.H.: Products of linear recurring sequences. J. Algebra 27, 147–157 (1973)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by T. Helleseth.
Rights and permissions
About this article
Cite this article
Tuxanidy, A., Wang, Q. Composed products and factors of cyclotomic polynomials over finite fields. Des. Codes Cryptogr. 69, 203–231 (2013). https://doi.org/10.1007/s10623-012-9647-9
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-012-9647-9
Keywords
- Factorization
- Composed products
- Cyclotomic polynomials
- Construction of irreducible polynomials
- Dickson polynomials
- Linear recurring sequences
- Linear feedback shift registers
- Linear complexity
- Stream cipher theory
- Finite fields