Factoring a binary polynomial of degree over one million

Authors:
Olaf Bonorden;Joachim von zur Gathen;Jürgen Gerhard;Olaf Müller
Affiliations:
Univ. Paderborn, Paderborn, Germany;Univ. Paderborn, Paderborn, Germany;Univ. Paderborn, Paderborn, Germany;Univ. Paderborn, Paderborn, Germany
Venue:
ACM SIGSAM Bulletin
Year:
2001

Citing 5
Cited 5

On arithmetical algorithms over finite fields

Journal of Combinatorial Theory Series A
A bridging model for parallel computation

Communications of the ACM
Arithmetic and factorization of polynomial over F2 (extended abstract)

ISSAC '96 Proceedings of the 1996 international symposium on Symbolic and algebraic computation
Parallel polynomial operations on SMPs: an overview

Journal of Symbolic Computation - Special issue on parallel symbolic computation
Factoring polynomials over finite fields: a survey

Journal of Symbolic Computation - Special issue on computational algebra and number theory: proceedings of the second Magma conference

Reconfigurable Implementation of Elliptic Curve Crypto Algorithms

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Polynomial factorization over F2

Mathematics of Computation
Polynomial factorization: a success story

ISSAC '03 Proceedings of the 2003 international symposium on Symbolic and algebraic computation
Cited References

Computer algebra handbook
A new sparse Gaussian elimination algorithm and the Niederreiter linear system for trinomials over F2

Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z2 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.