一个新的排序函数，用于在数字字段筛选中选择多项式

75 Years of Mathematics of Computation Pub Date : 1900-01-01 DOI:10.1090/CONM/754/15139

N. David, P. Zimmermann

{"title":"一个新的排序函数，用于在数字字段筛选中选择多项式","authors":"N. David, P. Zimmermann","doi":"10.1090/CONM/754/15139","DOIUrl":null,"url":null,"abstract":"This article explains why the classical Murphy-E ranking function might fail to correctly rank polynomial pairs in the Number Field Sieve, and proposes a new ranking function.","PeriodicalId":369218,"journal":{"name":"75 Years of Mathematics of\n Computation","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A new ranking function for polynomial selection in the number field sieve\",\"authors\":\"N. David, P. Zimmermann\",\"doi\":\"10.1090/CONM/754/15139\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This article explains why the classical Murphy-E ranking function might fail to correctly rank polynomial pairs in the Number Field Sieve, and proposes a new ranking function.\",\"PeriodicalId\":369218,\"journal\":{\"name\":\"75 Years of Mathematics of\\n Computation\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"75 Years of Mathematics of\\n Computation\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1090/CONM/754/15139\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"75 Years of Mathematics of\n Computation","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1090/CONM/754/15139","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文解释了经典Murphy-E排序函数在Number Field Sieve中不能正确排序多项式对的原因，并提出了一种新的排序函数。

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

查看原文本刊更多论文

A new ranking function for polynomial selection in the number field sieve

This article explains why the classical Murphy-E ranking function might fail to correctly rank polynomial pairs in the Number Field Sieve, and proposes a new ranking function.

求助全文

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

来源期刊

75 Years of Mathematics of Computation

自引率

0.00%

发文量