Turning Euler's factoring method into a factoring algorithm

Bulletin of the London Mathematical Society

Volumn 28, Issue 4, 1996, Pages 351-355

  Mckee, James ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039928909     PISSN: 00246093     EISSN: None     Source Type: Journal    
DOI: 10.1112/blms/28.4.351     Document Type: Article

References (9)

1. D. A. BURGESS, 'On character sums and primitive roots', Proc. London Math. Soc. 12 (1962) 179-192.
2. H. DAVENPORT, The higher arithmetic (6th edn, Cambridge University Press, 1992).
3. G. H. HARDY and E. M. WRIGHT, An introduction to the theory of numbers (5th edn, Oxford University Press, 1979).
4. N. KOBLITZ, A course in number theory and cryptography, Graduate Texts in Math. 114 (Springer, New York, 1987).
5. R. SHERMAN LEHMAN, 'Factoring large integers', Math. Comp. 28 (1974) 637-646.
6. H. W. LENSTRA JR, 'Divisors in residue classes', Math. Comp. 42 (1984) 331-340.
7. J. M. POLLARD, 'Theorems on factorization and primality testing', Proc. Cambridge Philos. Soc. 76 (1974) 521-528.
8. R. J. SCHOOF, 'Quadratic fields and factorization', Computational methods in number theory, Part II, Math. Centre Tracts 155 (ed. H. W. Lenstra Jr and R. Tijdeman, Mathematisch Centrum, Amsterdam, 1982).
9. V. STRASSEN, 'Einige Resultate über Berechnungskomplexität', Jahresber. Deutsch. Math.-Verein. 78 (1976/77) 1-8.