A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Polynomial factorization over ${\mathbb F}_2$
2002
Mathematics of Computation
Preserved Fulltext
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