Answers are grounded in this paper and cite their sources.
On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z 2 was completed on a 4-processor Linux PC, using roughly 100 CPU-hours. The basic approach is a combination of the factorization software BIPOLAR and a parallel version of Cantor's multiplication algorithm. The PUB-library (Paderborn University BSP library) is used for the implementation of the parallel communication.
No takes yet. Share an insight, caveat, or question.
Bonorden et al. (2001) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: