Title
Factoring a binary polynomial of degree over one million
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.
Year
DOI
Venue
2001
10.1145/504331.504333
ACM SIGSAM Bulletin
Keywords
Field
DocType
paderborn university bsp library,multiplication algorithm,binary field z2,parallel communication,basic approach,4-processor linux pc,factorization software,binary polynomial,pseudorandom polynomial,parallel version
Discrete mathematics,Multiplication algorithm,Polynomial,Parallel communication,Computer science,Software,Factorization,Factoring,Pseudorandom number generator,Binary number
Journal
Volume
Issue
Citations 
35
1
7
PageRank 
References 
Authors
0.76
6
4
Name
Order
Citations
PageRank
Olaf Bonorden11349.28
Joachim von zur Gathen21002135.30
Jürgen Gerhard3707.37
Olaf Müller471.10