Polynomial factorization over 𝔽₂
Joachim von zur Gathen, Jürgen Gerhard · Mathematics of Computation · 2002
We describe algorithms for polynomial factorization over the binary field F 2 {\mathbb F}_2 , and their implementation. They allow polynomials of degree up to 250 000 250\,000 to be factored in about one day of CPU time, distributing the work on two processors.