Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers Thorsten Kleinjung University of Bonn, Department of Mathematics, Beringstraße 1, DBonn,

First Page		Document Content
Date: 2006-03-21 11:54:50 Integer factorization algorithms Mathematics Quadratic sieve General number field sieve Integer factorization Prime number Factorization Number theory Factor base Shanks's square forms factorization		Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers Thorsten Kleinjung University of Bonn, Department of Mathematics, Beringstraße 1, DBonn, Add to Reading List Source URL: www.hyperelliptic.org Download Document from Source Website File Size: 129,63 KB Share Document on Facebook

	SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of DocID: 1u9dx - View Document
	SMOOTH NUMBERS AND THE QUADRATIC SIEVE Carl Pomerance When faced with a large number n to factor, what do you do first? You might say “Look at the last digit,” with the idea of cheaply pulling out possible factors of DocID: 1rfno - View Document
	Integer factorization, part 1: the Q sieve Integer factorization, part 2: detecting smoothness D. J. Bernstein DocID: 1rcdq - View Document
	Integer factorization, part 1: the Q sieve D. J. Bernstein Sieving small integers using primes: DocID: 1r3fs - View Document
	The Million-Key Question—Investigating the Origins of RSA Public Keys Petr Švenda, Matúš Nemec, Peter Sekan, Rudolf Kvašňovský, David Formánek, David Komárek, and Vashek Matyáš, Masaryk University https://www DocID: 1q9Fs - View Document