A Monte Carlo factoring algorithm with finite storage

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

Volumn 145 LNCS, Issue , 1982, Pages 19-33

  Schnorr, C P ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS; MATHEMATICAL STATISTICS - MONTE CARLO METHODS;

BIT-OPERATIONS; CLASS GROUP; CLASS NUMBERS; COMPOSITE INTEGERS; INTEGER-N; LOWER BOUNDS; RUNNING TIME; STORAGE SPACES;

ARTIFICIAL INTELLIGENCE; COMPUTER PROGRAMMING;

CLASS NUMBERS; DIVISORS; FACTORING; RECURSION;

EID: 0020227237     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0036466     Document Type: Conference Paper

References (19)

1. Brent, R.P.: An improved Monte Carlo factorization algorithm. BIT 20 (1980) 176-184.
2. Dixon, J.D.: Asymptotically fast factorization of integers. Mathematics of Computation 36 (1981) 255-260.
3. Gauss, C.F.: Disquisitiones Arithmetiquae. Leipzig 1801. German translation: Untersuchungen über höhere Mathematik. Springer, Berlin (1889).
4. Hardy, G.H. and Wright, E.M.: An Introduction to the Theory of Numbers. Oxford Univeristy Press, fifth edition (1979).
5. Knuth, D.E.: The Art Computer Programming, Volume 2, Seminumerical Algorithms. Second edition. Addison., Wesley (1981).
6. Lejeune Dirichlet, P.G. and Dedekind, R.: Vorlesungen über Zahlentheorie. Braunschweig 1893. Reprint: New York (1968).
7. Lenstra Jr., H.W.: On the calculation of regulators and class numbers of quadratic fields. Journées Arithmétiques 1980, J.V. Armitage (Ed.) Cambridge University Press (1982) 123-150.
8. Mathews, G.B.: Theory of numbers. 1892. Reprint: Chelsea, New York (1962).
9. Monier, L.: Algorithmes de factorisation d’entiers. Thèse d’informatique. Université Paris Sud (1980).
10. Morrison, M.A. and Brillhart, J.: A method of factorization and the factorization of F7. Math. Computation 29 (1975) 183-205.
11. Pollard, J.M.: A Monte Carlo method for factorization. BIT 15 (1975) 331-334.
12. Pomerance, C.: Analysis and comparison of some integer factoring algorithms. Computational Methods in Number Theory, R.Tijdemen, H.Lenstra (Eds.) Mathem. Centrum, Amsterdam (1981).
13. Rivest, R.L., Shamir, A., and Adleman, L.: A method for obtaining digital signatures and public key cryptosystems. Comm. ACM 21 (1978) 120-126.
14. Sattler, J. and Schnorr, C.P.: Ein Effizienzvergleich der Faktorisierungsverfahren von Morrison-Brillhart und Schroeppel. Preprint Universität Frankfurt 1981. to appear in Computing.
15. Shanks, D.: Class number, a theory of factorization and genera. Proc. Symp. Pure Math.Amer.Math.Soc. 20 (1971) 415-440.
16. Schnorr, C.P.: Refined analysis and improvements on some factoring algorithms. Journal of Algorithms 3 (1982) 101-127.
17. Siegel, C.L.: Über die Klassenzahl quadratischer Zahlkörper. Acta Arith. 1 (1936) 83-86.
18. Wagstaff, S.S. and Wunderlich, M.C.: A comparison of two factorization methods. Unpublished manuscript.
19. Zimmer, H.G.: Computational Problems, Methods, and Results in Algebraic Number Theory. Lecture Notes in Mathematics 262. Springer, Berlin-New York (1972).