Cyclotomic Polynomials and Factorization Theorems

DOI10.2307/2321679MaRDI QIDQ4187896zbMATH OpenOpenAlexFDO

Authors S. W. Golomb

Publication date 1978

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2321679

zbMATH Keywords

Cyclotomic PolynomialsFactorization

Mathematics Subject Classification ID

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Polynomials in number theory (11C08) Polynomials (irreducibility, etc.) (11R09) Polynomials over finite fields (11T06)

Cited in

(5)

• Using abelian varieties to improve pairing-based cryptography
• Obtaining Specified Irreducible Polynomials over Finite Fields
• On irreducible polynomials over \(\mathbb Q\) which are reducible over \(\mathbb F_p\) for all \(p\)
• Factorization, irreducibility, and splitting properties of Chebyshev polynomials
• Algebraic constructions for Costas arrays

This page was built for publication: Cyclotomic Polynomials and Factorization Theorems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4187896)