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

	Lecture 19, Thurs March 30: RSA and Shor’s Algorithm Today we’ll see Shor’s algorithm. Given a positive integer N, which we’ll assume for simplicity is a product of two primes \|and , this algorithm lets DocID: 1xVSj - View Document
	PDF Document DocID: 1xRwQ - View Document
	PDF Document DocID: 1xu6k - View Document
	PDF Document DocID: 1x9q3 - View Document
	PDF Document DocID: 1x1dn - View Document