[{"title":"Factoring a binary polynomial of degree over one million","doi":"10.1145/504331.504333","date_updated":"2022-01-06T06:55:58Z","author":[{"first_name":"Olaf","last_name":"Bonorden","full_name":"Bonorden, Olaf"},{"full_name":"von zur Gathen, Joachim","last_name":"von zur Gathen","first_name":"Joachim"},{"first_name":"Jürgen","full_name":"Gerhard, Jürgen","last_name":"Gerhard"},{"first_name":"Olaf","full_name":"Müller, Olaf","last_name":"Müller"}],"date_created":"2021-09-03T09:08:27Z","year":"2001","citation":{"apa":"Bonorden, O., von zur Gathen, J., Gerhard, J., &#38; Müller, O. (2001). Factoring a binary polynomial of degree over one million. <i>ACM SIGSAM Bulletin</i>, 16–18. <a href=\"https://doi.org/10.1145/504331.504333\">https://doi.org/10.1145/504331.504333</a>","mla":"Bonorden, Olaf, et al. “Factoring a Binary Polynomial of Degree over One Million.” <i>ACM SIGSAM Bulletin</i>, 2001, pp. 16–18, doi:<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>.","short":"O. Bonorden, J. von zur Gathen, J. Gerhard, O. Müller, ACM SIGSAM Bulletin (2001) 16–18.","bibtex":"@article{Bonorden_von zur Gathen_Gerhard_Müller_2001, title={Factoring a binary polynomial of degree over one million}, DOI={<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>}, 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} }","ama":"Bonorden O, von zur Gathen J, Gerhard J, Müller O. Factoring a binary polynomial of degree over one million. <i>ACM SIGSAM Bulletin</i>. 2001:16-18. doi:<a href=\"https://doi.org/10.1145/504331.504333\">10.1145/504331.504333</a>","chicago":"Bonorden, Olaf, Joachim von zur Gathen, Jürgen Gerhard, and Olaf Müller. “Factoring a Binary Polynomial of Degree over One Million.” <i>ACM SIGSAM Bulletin</i>, 2001, 16–18. <a href=\"https://doi.org/10.1145/504331.504333\">https://doi.org/10.1145/504331.504333</a>.","ieee":"O. Bonorden, J. von zur Gathen, J. Gerhard, and O. Müller, “Factoring a binary polynomial of degree over one million,” <i>ACM SIGSAM Bulletin</i>, pp. 16–18, 2001."},"page":"16-18","publication_status":"published","publication_identifier":{"issn":["0163-5824"]},"language":[{"iso":"eng"}],"_id":"23731","user_id":"15415","department":[{"_id":"63"}],"abstract":[{"lang":"eng","text":"<jats:p>\r\n            On 22 May 2000, the factorization of a pseudorandom polynomial of degree 1 048 543 over the binary field Z\r\n            <jats:sub>2</jats:sub>\r\n            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.\r\n          </jats:p>"}],"status":"public","type":"journal_article","publication":"ACM SIGSAM Bulletin"}]