Building the Billion-Mulmod PC Bo-Yin Yang Institute of Information Science Academia Sinica Taipei, Taiwan

First Page		Document Content
Date: 2009-09-26 00:44:36 Finite fields Integer factorization algorithms Lenstra elliptic-curve factorization Elliptic curve Mathematics		Building the Billion-Mulmod PC Bo-Yin Yang Institute of Information Science Academia Sinica Taipei, Taiwan Add to Reading List Source URL: www.hyperelliptic.org Download Document from Source Website File Size: 1,44 MB 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: 1rfno - View Document
	Algorithms and Data Structures (WS15/16) Example Solutions for Unit 4 Problem 1 skipped DocID: 1rcMI - 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