The Magic Words Are Squeamish Ossifrage (Extended Abstract)

by Derek Atkins , Michael Graff , Arjen K. Lenstra , Paul C. Leyland
Citations:2 - 0 self

Documents Related by Co-Citation

4 How to find small factors of integers, accepted to Mathematics of Computation; now being revamped – Daniel J Bernstein
3 How to find smooth parts of integers, draft. URL: http://cr.yp.to/ papers.html#smoothparts – Daniel J Bernstein
2 Scaled remainder trees, draft. URL: http://cr.yp.to/ papers.html#scaledmod – Daniel J Bernstein
4 te Riele, Factoring integers with large-prime variations of the quadratic sieve, Experimental Mathematics 5 – Henk Boender, J J Herman - 1996
1 Ming-Deh Huang (editors), Algorithmic number theory: first international symposium – Leonard M Adleman - 1994
1 Intractable problems in number theory – Eric Bach
1 Toward a theory of Pollard’s rho method, Information and Computation 90 – Eric Bach - 1991
1 Factoring with cyclotomic polynomials, Mathematics of Computation 52 – Eric Bach, Jeffrey Shallit - 1989
1 The multiple-lattice number field sieve, in [19 – Daniel J Bernstein - 1995
1 Joerg Zayer, An implementation of the general number field sieve (extended abstract – Johannes Buchmann, J Loho
1 der Poorten (editors), Computational algebra and number theory: CANT2 – Wieb Bosma, Alf J van - 1995
1 Chaum (editor), Advances in cryptology: Crypto 83 – David - 1984
4 An approximate probabilistic model for structured Gaussian elimination – E A Bender, E R Can eld - 1999
7 Fast multiplication and its applications, to appear in Buhler-Stevenhagen Algorithmic number theory book. URL:http://cr.yp.to/papers.html#multapps – Daniel J Bernstein
12 A general number field sieve implementation – D J Bernstein, A K Lenstra - 1993
2 Analytic Number Theory – P T Bateman, H G Diamond
8 An implementation of the elliptic curve integer factorization method, Computational Algebra and Number Theory (edited by – W Bosma, A K Lenstra - 1995
21 Factoring Numbers Using Singular Integers – L M Adleman - 1991
59 Multiple-Precision Zero-Finding Methods and the Complexity of Elementary Function Evaluation – Richard P Brent - 1976