20 years of ECM

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4076 LNCS, Issue , 2006, Pages 525-542

  Zimmermann, Paul ^a   Dodson, Bruce ^b  

^a LORIA   (France)

^b LEHIGH UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; INTEGER PROGRAMMING;

ELLIPTIC CURVE METHOD; IMPLEMENTATION SIDES; STATE-OF-THE-ART;

NUMBER THEORY;

EID: 33746698935     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11792086_37     Document Type: Conference Paper

References (24)

1. BARRETT, P. Implementing the Rivest Shamir and Adleman public key encryption algorithm on a standard digital signal processor. In Advances in Cryptology, Proceedings of Crypto'86 (1987), A. M. Odlyzko, Ed., vol. 263 of Lecture Notes in Computer Science, Springer-Verlag, pp. 311-323.
2. BERNSTEIN, D. J. Removing redundancy in high-precision Newton iteration. http://cr.yp.to/fastnewton.html, 2004. 13 pages.
3. BERNSTEIN, D. J. Scaled remainder trees, http://cr.yp-to/papers.html# scaledmod, 2004. 8 pages.
4. BOSTAN, A., LECERF, G., AND SCHOST, E. Tellegen's principle into practice. In Proceedings of the 2003 international symposium on Symbolic and algebraic computation (Philadelphia, PA, USA, 2003), pp. 37-44.
5. BRENT, R. P. Some integer factorization algorithms using elliptic curves. Australian Computer Science Communications 8 (1986), 149-163. http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pub/pub102.html.
6. BRENT, R. P. Factor: an integer factorization program for the IBM PC. Tech. Rep. TR-CS-89-23, Australian National University, 1989. 7 pages. Available at http://wwwmaths.anu.edu.au/~brent/pub/pub117.html.
7. BRENT, R. P. Factorization of the tenth Fermat number. Mathematics of Computation 68, 225 (1999), 429-451.
8. BRENT, R. P., AND POLLARD, J. M. Factorization of the eighth Fermat number. Mathematics of Computation 36 (1981), 627-630.
9. BURNIKEL, C., AND ZIEGLER, J. Fast recursive division. Research Report MPI-I-98-1-022, MPI Saarbrücken, 1998.
10. CHARRON, T., DAMINELLI, N., GRANLUND, T., LEYLAND, P., AND ZIMMERMANN, P. The ECMNET Project, http://www.loria.fr/~zimmerma/ecmnet/.
11. GRANLUND, T. GNU MP: The GNU Multiple Precision Arithmetic Library, 4.2 ed., 2006. http://www.swox.se/gmp/#DOC.
12. HANROT, G., QUERCIA, M., AND ZIMMERMANN, P. The middle product algorithm, I. Speeding up the division and square root of power series. AAECC 14, 6 (2004), 415-438.
13. KRUPPA, A. Optimising the enhanced standard continuation of the P-1 factoring algorithm. Diplomarbeit Report, Technische Universität München, 2005. http://home.in.tum.de/~kruppa/DA.pdf, 55 pages.
14. LENSTRA, H. W. Factoring integers with elliptic curves. Annals of Mathematics 126 (1987), 649-673.
15. The Magma computational algebra system, http://magma.maths.usyd.edu.au/, 2005. Version V2.12.
16. m-n) via Lucas chains, 1983. Available at ftp.cwi.nl:/pub/pmontgom/Lucas.ps.gz.
17. MONTGOMERY, P. L. Modular multiplication without trial division. Mathematics of Computation 44, 170 (1985), 519-521.
18. MONTGOMERY, P. L. Speeding the Pollard and elliptic curve methods of factorization. Mathematics of Computation 48, 177 (1987), 243-264.
19. MONTGOMERY, P. L. An FFT Extension of the Elliptic Curve Method of Factorization. PhD thesis, University of California, Los Angeles, 1992. ftp.cwi.nl:/pub/pmontgom/ucladissertation.psl.gz.
20. PHATAK, D. S., AND GOFF, T. Fast modular reduction for large wordlengths via one linear and one cyclic convolution. In Proceedings of 17th IEEE Symposium on Computer Arithmetic (ARITH'17), Cape Cod, MA, USA (2005), IEEE Computer Society, pp. 179-186.
21. SCHÖNHAGE, A., AND STRASSEN, V. Schnelle Multiplikation großer Zahlen. Computing 7 (1971), 281-292.
22. VON ZUR GATHEN, J., AND GERHARD, J. Modern Computer Algebra. Cambridge University Press, 1999.
23. WAGSTAFF, S. S. The Cunningham project, http://www.cerias.purdue.edu/homes/ssw/cun/.
24. WILLIAMS, H. C. A p + 1 method of factoring. Mathematics of Computation 39, 159 (1982), 225-234.