Integer Factorization and Computing Discrete Logarithms in Maple Aaron Bradford∗, Michael Monagan∗, Colin Percival∗ , , Department of Mathematics, Simon Fr

First Page		Document Content
Date: 2006-05-14 06:12:35 Cryptography Integer factorization algorithms Mathematics Abstract algebra Quadratic sieve General number field sieve Prime number Safe prime Discrete logarithm RSA Sieve of Atkin Quadratic residue		Integer Factorization and Computing Discrete Logarithms in Maple Aaron Bradford∗, Michael Monagan∗, Colin Percival∗ , , Department of Mathematics, Simon Fr Add to Reading List Source URL: www.daemonology.net Download Document from Source Website File Size: 136,67 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