Factorization of a 768-bit RSA modulus version 1.21, January 13, 2010 Thorsten Kleinjung1 , Kazumaro Jens Franke3 , Arjen K. Lenstra1 , Emmanuel Thomé4 ,

First Page		Document Content
Date: 2010-01-13 11:00:27 Number theory Quadratic sieve Special number field sieve General number field sieve Quadratic residue Prime number Factor base Lattice sieving RSA Integer factorization algorithms Cryptography Mathematics		Factorization of a 768-bit RSA modulus version 1.21, January 13, 2010 Thorsten Kleinjung1 , Kazumaro Jens Franke3 , Arjen K. Lenstra1 , Emmanuel Thomé4 , Add to Reading List Source URL: www.loria.fr Download Document from Source Website File Size: 579,37 KB Share Document on Facebook

	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: 1u9dx - 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
	The Million-Key Question—Investigating the Origins of RSA Public Keys Petr Švenda, Matúš Nemec, Peter Sekan, Rudolf Kvašňovský, David Formánek, David Komárek, and Vashek Matyáš, Masaryk University https://www DocID: 1q9Fs - View Document