<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2010-03-08 10:09:23Quadratic sieve General number field sieve Integer factorization RSA Factoring Challenge RSA numbers RSA Prime number Factorization Lattice sieving Integer factorization algorithms Cryptography Mathematics |
| CONTINUED FRACTIONS AND LATTICE SIEVING JENS FRANKE, THORSTEN KLEINJUNG Abstract. We present a new method of lattice sieving which we expect to be faster by a constant factor than the method of Pollard, and which has beeDocID: 1xUb2 - View Document |
| New directions in nearest neighbor searching with applications to lattice sieving-0.1cmDocID: 1u7d4 - View Document |
| Progressive lattice sievingDocID: 1tXDs - View Document |
| Factorization of a 768-bit RSA modulus version 1.21, January 13, 2010 Thorsten Kleinjung1 , Kazumaro Jens Franke3 , Arjen K. Lenstra1 , Emmanuel Thomé4 ,DocID: 15Dqm - View Document |