对一个除以一百万次的二元多项式进行因式分解

SIGSAM Bull. Pub Date : 2001-03-01 DOI:10.1145/504331.504333

Olaf Bonorden, J. Gathen, J. Gerhard, Olaf Müller

{"title":"对一个除以一百万次的二元多项式进行因式分解","authors":"Olaf Bonorden, J. Gathen, J. Gerhard, Olaf Müller","doi":"10.1145/504331.504333","DOIUrl":null,"url":null,"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.","PeriodicalId":314801,"journal":{"name":"SIGSAM Bull.","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Factoring a binary polynomial of degree over one million\",\"authors\":\"Olaf Bonorden, J. Gathen, J. Gerhard, Olaf Müller\",\"doi\":\"10.1145/504331.504333\",\"DOIUrl\":null,\"url\":null,\"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.\",\"PeriodicalId\":314801,\"journal\":{\"name\":\"SIGSAM Bull.\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-03-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGSAM Bull.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/504331.504333\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGSAM Bull.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/504331.504333","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 9

摘要

2000年5月22日，在一台4处理器的Linux PC上完成了对二进制域Z2上的1 048 543次伪随机多项式的分解，使用了大约100个cpu小时。基本方法是结合分解软件BIPOLAR和康托尔乘法算法的并行版本。pub库(帕德博恩大学BSP库)用于实现并行通信。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Factoring a binary polynomial of degree over one million

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIGSAM Bull.

自引率

0.00%

发文量