5 Factorization of polynomials
Similar to what we have done for the computation of gcds of polynomials, we will reduce the computation of the factors of an integral polynomial to the computation of the factors of the polynomial modulo a prime number. So we have to investigate this problem first, i.e., we consider the problem of factoring a polynomial a(x) ∈ ℤp[x], p a prime number. W.l.o.g. we may assume that lc(a) = 1.
KeywordsPrime Number Arithmetic Operation Minimal Polynomial Irreducible Polynomial Irreducible Factor
Unable to display preview. Download preview PDF.