文章基本信息

标题：Polynomial selection in number field sieve for integer factorization
本地全文：下载
作者：Gireesh Pandey ; Gireesh Pandey ; S.K. Pal 等
期刊名称：Perspectives in Science
印刷版ISSN：2213-0209
电子版ISSN：2213-0209
出版年度：2016
卷号：8
页码：101-103
DOI：10.1016/j.pisc.2016.04.007
语种：English
出版社：Elsevier
摘要：Summary The general number field sieve (GNFS) is the fastest algorithm for factoring large composite integers which is made up by two prime numbers. Polynomial selection is an important step of GNFS. The asymptotic runtime depends on choice of good polynomial pairs. In this paper, we present polynomial selection algorithm that will be modelled with size and root properties. The correlations between polynomial coefficient and number of relations have been explored with experimental findings.
关键词：Integer factorization; Number field; Polynomial selection; Public key cryptography;