Arithmetic and factorization of polynomial over F2 (extended abstract)
Joachim von zur Gathen, Jürgen Gerhard · 1996
We describe algorithms for polynomial multiplication and polynomial factorization over the binary field IF2.and their implementation.They allow polynomials of degree up to 100,000 to be factored in about one dqy of CPU time.