Related Concepts
Definition
A polynomial that is not divisible by any smaller polynomials other than trivial ones is an irreducible polynomial.
Theory
Let f(x) be a polynomial
where the coefficients \({f}_{0},\ldots, {f}_{d}\) are elements of a field F. If there is another polynomial g(x) over F with degree between 1 and d − 1 such that g(x) divides f(x), then f(x) is reducible. Otherwise, f(x)is irreducible. (Nonzero polynomials of degree 0, i.e., nonzero elements of F, divide every polynomial so they are considered “trivial” factors.)
As an example, the polynomial \({x}^{2} + 1\) over the finite field F \({}_{2}\) is reducible since \({x}^{2} + 1 = {(x + 1)}^{2}\), whereas the polynomial \({x}^{2} + x + 1\) is irreducible.
A representation of the finite field \( {\mathbb{F}}_{{q}^{d}}\) can be constructed from a representation of the finite field F \({}_{q}\)together...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Kaliski, B. (2011). Irreducible Polynomial. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_415
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_415
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering