Concept
Brun sieve
Related publications (4)
Statistics Of Prime Divisors In Function Fields
We show that the prime divisors of a random polynomial in F-q[t] are typically "Poisson distributed". This result is analogous to the result in Z of Granville [1]. Along the way, we use a sieve developed by Granville and Soundararajan [2] to give a simple ...
2009Factorization of RSA-140 using the number field sieve
Arjen Lenstra, Pénélope Leyland, Patric Zimmermann
On February 2, 1999, we completed the factorization of the 140-digit number RSA-140 with the help of the Number Field Sieve factoring method (NFS). This is a new general factoring record. The previous record was established on April 10, 1996 by the factori ...
Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa1999The Factorization of the ninth Fermat Number
In this paper we exhibit the full prime factorization of the ninth Fermat number F9 = 2(512) + 1. It is the product of three prime factors that have 7, 49, and 99 decimal digits. We found the two largest prime factors by means of the number field sieve, wh ...
American Mathematical Society1993The number field sieve
The number field sieve is an algorithm to factor integers of the form for small positive and . The authors present a report on work in progress on this algorithm. They informally describe the algorithm, discuss several implementation related ...
Springer Berlin Heidelberg1993