Speeding Fermat's factoring method

Mathematics of Computation

Volumn 68, Issue 228, 1999, Pages 1729-1737

  Mckee, James ^a  

^a UNIVERSITY OF OXFORD   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033421224     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/s0025-5718-99-01133-3     Document Type: Article

References (11)

1. H. Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics 138, Springer, 1993. MR 94i:11105
2. H. Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics 138, Springer, 1993. MR 94i:11105
3. R.S. Lehman, Factoring large integers, Math. Comp., 28 (1974), 637-646. MR 49:4949
4. R.S. Lehman, Factoring large integers, Math. Comp., 28 (1974), 637-646. MR 49:4949
5. D.H. Lehmer and Emma Lehmer, A new factorization technique using quadratic forms, Math. Comp., 28 (1974), 625-635. MR 49:7204
6. D.H. Lehmer and Emma Lehmer, A new factorization technique using quadratic forms, Math. Comp., 28 (1974), 625-635. MR 49:7204
7. J.F. McKee, Turning Euler's factoring method into a factoring algorithm, Bull. London Math. Soc., 28 (1996), 351-355. MR 97f:11010
8. J.F. McKee, Turning Euler's factoring method into a factoring algorithm, Bull. London Math. Soc., 28 (1996), 351-355. MR 97f:11010
9. J.F. McKee and R.G.E. Pinch, Old and new deterministic factoring algorithms, in Algorithmic Number Theory, Proceedings of the Second International Symposium, ANTS-II (H. Cohen, ed.), Lecture Notes in Computer Science 1122, Springer, 1996, pp. 217-224. MR 98a:11183
10. J.F. McKee and R.G.E. Pinch, Old and new deterministic factoring algorithms, in Algorithmic Number Theory, Proceedings of the Second International Symposium, ANTS-II (H. Cohen, ed.), Lecture Notes in Computer Science 1122, Springer, 1996, pp. 217-224. MR 98a:11183
11. J.M. Pollard, Personal communication.