A monte carlo factoring algorithm with linear storage

Mathematics of Computation

Volumn 43, Issue 167, 1984, Pages 289-311

  Schnorr, C P ^a   Lenstra, H W ^b  

^a GOETHE UNIVERSITY   (Germany)

^b UNIVERSITY OF AMSTERDAM   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84966241531     PISSN: 00255718     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0025-5718-1984-0744939-5     Document Type: Article

References (23)

1. R. P. Brent, "An improved Monte Carlo factorization algorithm, " BIT, v. 20, 1980, p. 176-184.
2. J. W. S. Cassels, Rational Quadratic Forms, Academic Press, London, New York, 1978.
3. H. Cohen, H. W. Lenstra., Divisibility by Small Primes of Class Numbers, Personal communication, 1982.
4. J. D. Dixon, "Asymptotically fast factorization of integers, " Math. Comp., v. 36, 1981, p. 255-260.
5. C. F. Gauss, Disquisitiones Arithmeticae, Leipzig, English transi, by A. A. Clarke, Yale University Press, New Haven and London, 1966.
6. G. H. Hardy, E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, Oxford, 1979.
7. D. E. Knuth, Art of Computer Programming, Seminumerical Algorithms, 2nd ed., Addison-Wesley, Reading, Mass., Vol. 2 1981.
8. P. G. Lejeune Dirichlet, R. Dedekind, Vorlesungen uber Zahlentheorie, Braunschweig, reprint, New York, 1968.
9. H. W. Lenstra., On the Calculation of Regulators and Class Numbers of Quadratic Fields, Journees Arithmetiques (J. V. Armitage, Ed.), Cambridge Univ. Press, Oxford, 1982, p. 123-150.
10. G. B. Mathews, Theory of numbers, Reprint, Chelsea, New York, 1962.
11. L. Monier, Algorithmes de Factorisation d Entiers, Thase dinformatique, Universita Paris Sud, 1980.
12. M. A. Morrison, J. Brillhart, "A method of factorization and the factorization of F7, " Math. Comp., v. 29, 1975, p. 183-205.
13. J. M. Pollard, "A Monte Carlo method for factorization, " BIT, v. 15, 1975, p. 331-334.
14. C. Pomerance, "Analysis and comparison of some integer factoring algorithms, " Computational Methods in Number Theory (R. Tijdemen and H. Lenstra, Eds.), Mathematical Centrum, Amsterdam, 1981.
15. R. L. Rivest, A. Shamir, L. Adleman, "A method for obtaining digital signatures and public key cryptosystems, " Comm. ACM, v. 21, 1978, p. 120-126.
16. J. Sattler, C. P. Schnorr, "Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison Brillhart und Schroeppel, " Computing, v. 30, 1983, p. 91-110.
17. D. Shanks, Class Number, A Theory of Factorization, and Genera, Proc. Sympos. Pure Math, Amer. Math. Soc., Providence, R. I., 1971, vol. 20 p. 415-440.
18. J. Sattler, C. P. Schnorr, Generating Random Walks in Groups, Preprint, Universitat Frankfurt, submitted for publication. 1983
19. C. P. Schnorr, "Refined analysis and improvements on some factoring algorithms, " J. Algorithms, v. 3, 1982, p. 101-127.
20. C. P. Schnorr, M. Seysen, An Improved Composition Algorithm, Preprint, Universitat Frankfurt, submitted for publication. 1982
21. C. L. Siegel, "Uber die Klassenzahl quadratischer Zahlkorper, " Acta Arith., v. 1, 1936, p. 83-86.
22. S. S. Wagstaff, M. C. Wunderlich, A Comparison of Two Factorization Methods, Unpublished manuscript.
23. H. G. Zimmer, Computational Problems, Methods, and Results in Algebraic Number Theory, Lecture Notes in Math, Springer, Berlin and New York, Vol. 262 1972.