Polynomial factorization over ${\mathbb F}_2$

Joachim von zur Gathen, Jürgen Gerhard
2002 Mathematics of Computation  
We describe algorithms for polynomial factorization over the binary field F 2 , and their implementation. They allow polynomials of degree up to 250 000 to be factored in about one day of CPU time, distributing the work on two processors.
doi:10.1090/s0025-5718-02-01421-7 fatcat:qoigim4n6nbjpi2hsdxsuomjpe