Factoring a binary polynomial of degree over one million
O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.
Download
No fulltext has been uploaded.
Journal Article
| Published
| English
Author
Bonorden, Olaf;
von zur Gathen, Joachim;
Gerhard, Jürgen;
Müller, Olaf
Abstract
<jats:p>
On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z
<jats:sub>2</jats:sub>
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.
</jats:p>
Publishing Year
Journal Title
ACM SIGSAM Bulletin
Page
16-18
ISSN
LibreCat-ID
Cite this
Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin. 2001:16-18. doi:10.1145/504331.504333
Bonorden, O., von zur Gathen, J., Gerhard, J., & Müller, O. (2001). Factoring a binary polynomial of degree over one million. ACM SIGSAM Bulletin, 16–18. https://doi.org/10.1145/504331.504333
@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring a binary polynomial of degree over one million}, DOI={10.1145/504331.504333}, journal={ACM SIGSAM Bulletin}, author={Bonorden, Olaf and von zur Gathen, Joachim and Gerhard, Jürgen and Müller, Olaf}, year={2001}, pages={16–18} }
Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller. “Factoring a Binary Polynomial of Degree over One Million.” ACM SIGSAM Bulletin, 2001, 16–18. https://doi.org/10.1145/504331.504333.
O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” ACM SIGSAM Bulletin, pp. 16–18, 2001.
Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.” ACM SIGSAM Bulletin, 2001, pp. 16–18, doi:10.1145/504331.504333.