Factorization of a 1061-bit number by the Special Number Field Sieve Greg Childers

First Page		Document Content
Date: 2013-11-22 18:19:02 General number field sieve Special number field sieve Integer factorization Arjen Lenstra Herman te Riele Factor base RSA Factorization Jens Franke Integer factorization algorithms Cryptography Mathematics		Factorization of a 1061-bit number by the Special Number Field Sieve Greg Childers Add to Reading List Source URL: physics.fullerton.edu Download Document from Source Website File Size: 148,62 KB Share Document on Facebook

	Factorization of a 1061-bit number by the Special Number Field Sieve Greg Childers California State University Fullerton Fullerton, CAAugust 4, 2012 DocID: 17OQ6 - View Document
	Factorization of a 768-bit RSA modulus Paul Zimmermann (joint work with T. Kleinjung. K. Aoki, J. Franke, A. Lenstra, E. Thomé, J. Bos, P. Gaudry, A. Kruppa, P. Montgomery, D. A. Osvik, H. te Riele and A. Timofeev) /* DocID: 7tZM - View Document
	New Computations Concerning the Cohen-Lenstra Heuristics Herman te Riele and Hugh Williams DocID: 4goK - View Document
	Factorization of a 1061-bit number by the Special Number Field Sieve Greg Childers DocID: 4evS - View Document