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

First Page		Document Content
Date: 2015-01-20 08:14:47 Theoretical computer science Quadratic sieve General number field sieve Rational sieve Quadratic residue Lattice sieving Integer factorization Prime number RSA Integer factorization algorithms Mathematics Cryptography		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 Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 218,75 KB Share Document on Facebook

	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 bee DocID: 1xUb2 - View Document
	New directions in nearest neighbor searching with applications to lattice sieving-0.1cm DocID: 1u7d4 - View Document
	Progressive lattice sieving DocID: 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