Polynomial Selection in Number Field Sieve for Integer Factorization

Publication date: Available online 20 April 2016 Source:Perspectives in Science Author(s): Gireesh Pandey, S.K. Pal 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 modeled with size and root properties. The correlations between polynomial coefficient and number of relations have been explored with experimental findings.

Source: Perspectives in Science - April 20, 2016 Category: Science Source Type: research