Sieve theory

Results: 106



#Item
102157 Functional Programming - Sequences

02157 Functional Programming - Sequences

Add to Reading List

Source URL: www.imm.dtu.dk

Language: English - Date: 2013-01-17 17:30:05
2SMOOTH 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

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

Add to Reading List

Source URL: www.mat.uniroma2.it

Language: English - Date: 2007-11-23 17:17:47
3Integer factorization, part 1: the Q sieve Integer factorization, part 2: detecting smoothness D. J. Bernstein

Integer factorization, part 1: the Q sieve Integer factorization, part 2: detecting smoothness D. J. Bernstein

Add to Reading List

Source URL: www.mat.uniroma2.it

Language: English - Date: 2006-11-12 13:56:00
4Integer factorization, part 1: the Q sieve D. J. Bernstein Sieving small integers using primes:

Integer factorization, part 1: the Q sieve D. J. Bernstein Sieving small integers using primes:

Add to Reading List

Source URL: www.mat.uniroma2.it

Language: English - Date: 2006-11-12 13:55:56
5doi:j.jnt

doi:j.jnt

Add to Reading List

Source URL: www.mast.queensu.ca

Language: English - Date: 2008-06-23 15:32:43
6PII: 0022-314X

PII: 0022-314X

Add to Reading List

Source URL: www.mast.queensu.ca

Language: English - Date: 2016-03-21 18:12:27
7International Mathematical Olympiad Preliminary Selection Contest 2004 — Hong Kong Outline of Solutions  Answers:

International Mathematical Olympiad Preliminary Selection Contest 2004 — Hong Kong Outline of Solutions Answers:

Add to Reading List

Source URL: web.hku.hk

Language: English - Date: 2013-03-15 02:40:55
8FACTORIZATION TECHNIQUES ELVIS NUNEZ AND CHRIS SHAW Abstract. The security of the RSA public key cryptosystem relies upon the computational difficulty of deriving the factors of a particular semiprime modulus. In this pa

FACTORIZATION TECHNIQUES ELVIS NUNEZ AND CHRIS SHAW Abstract. The security of the RSA public key cryptosystem relies upon the computational difficulty of deriving the factors of a particular semiprime modulus. In this pa

Add to Reading List

Source URL: davidlowryduda.com

Language: English - Date: 2016-05-25 03:59:31
9Innovations in Computer ScienceIdeal Forms of Coppersmith’s Theorem and Guruswami-Sudan List Decoding Henry Cohn∗ Nadia Heninger? Microsoft Research New England, One Memorial Drive, Cambridge, MA 02142

Innovations in Computer ScienceIdeal Forms of Coppersmith’s Theorem and Guruswami-Sudan List Decoding Henry Cohn∗ Nadia Heninger? Microsoft Research New England, One Memorial Drive, Cambridge, MA 02142

Add to Reading List

Source URL: conference.itcs.tsinghua.edu.cn

Language: English - Date: 2010-12-15 03:49:23
10Square Root Algorithms for the Number Field Sieve Emmanuel Thomé INRIA Nancy, Villers-lès-Nancy, France  Abstract. We review several methods for the square root step of the

Square Root Algorithms for the Number Field Sieve Emmanuel Thomé INRIA Nancy, Villers-lès-Nancy, France Abstract. We review several methods for the square root step of the

Add to Reading List

Source URL: www.loria.fr

Language: English - Date: 2012-11-29 10:44:38