Date: 2007-11-23 17:17:47Mathematics Integer factorization algorithms Number theory Quadratic sieve Special number field sieve Quadratic residue General number field sieve Prime number Lenstra elliptic curve factorization Sieve of Eratosthenes Euclidean algorithm Prime-counting function | | SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors ofAdd to Reading ListSource URL: www.mat.uniroma2.itDownload Document from Source Website File Size: 92,71 KBShare Document on Facebook
|