The Number Field Sieve Factorization of Large Numbers

First Page		Document Content
Date: 2006-11-06 07:51:37 Numbers Special number field sieve General number field sieve Quadratic sieve Lenstra elliptic curve factorization Sieve theory Prime number Prime factor Rational sieve Integer factorization algorithms Number theory Mathematics		The Number Field Sieve Factorization of Large Numbers Add to Reading List Source URL: wob.iai.uni-bonn.de Download Document from Source Website File Size: 545,44 KB Share Document on Facebook

	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 DocID: 1o65x - View Document
	arXiv:1008.1284v1 [math.NT] 6 AugIdeal forms of Coppersmith’s theorem and Guruswami-Sudan list decoding Henry Cohn DocID: 124jz - View Document
	Use of SIMD-Based Data Parallelism to Speed up Sieving in Integer-Factoring Algorithms ? Binanda Sengupta and Abhijit Das Department of Computer Science and Engineering Indian Institute of Technology Kharagpur, West Beng DocID: MdPg - View Document
	On the Cost of Factoring RSA-1024 Adi Shamir DocID: 4JM4 - View Document
	The Number Field Sieve Factorization of Large Numbers DocID: 2Se9 - View Document