doi:j.jnt

First Page		Document Content
Date: 2008-06-23 15:32:43 Mathematics Sieve theory Algebra Polynomials Turn sieve Prime number Number theory Factorization of polynomials over finite fields Average order of an arithmetic function		doi:j.jnt Add to Reading List Source URL: www.mast.queensu.ca Download Document from Source Website File Size: 185,34 KB Share Document on Facebook

	02157 Functional Programming - Sequences DocID: 1rsIU - View Document
	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 of DocID: 1rfno - View Document
	Integer factorization, part 1: the Q sieve Integer factorization, part 2: detecting smoothness D. J. Bernstein DocID: 1rcdq - View Document
	Integer factorization, part 1: the Q sieve D. J. Bernstein Sieving small integers using primes: DocID: 1r3fs - View Document
	doi:j.jnt DocID: 1qIei - View Document