A kilobit special number field sieve factorization Kazumaro Aoki1 , Jens Franke2 , Thorsten Kleinjung2 , Arjen K. Lenstra3 , and Dag Arne Osvik3 1 2

First Page		Document Content
Date: 2007-05-31 05:26:07 Special number field sieve Integer factorization General number field sieve Factorization RSA Lenstra elliptic curve factorization Factor base Quadratic sieve Integer factorization records Integer factorization algorithms Cryptography Mathematics		A kilobit special number field sieve factorization Kazumaro Aoki1 , Jens Franke2 , Thorsten Kleinjung2 , Arjen K. Lenstra3 , and Dag Arne Osvik3 1 2 Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 119,58 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