Skip to Main Content

Mathematics of Computation

Published by the American Mathematical Society since 1960 (published as Mathematical Tables and other Aids to Computation 1943-1959), Mathematics of Computation is devoted to research articles of the highest quality in computational mathematics.

ISSN 1088-6842 (online) ISSN 0025-5718 (print)

The 2020 MCQ for Mathematics of Computation is 1.78.

What is MCQ? The Mathematical Citation Quotient (MCQ) measures journal impact by looking at citations over a five-year period. Subscribers to MathSciNet may click through for more detailed information.

 

The expectation of success using a Monte Carlo factoring method—some statistics on quadratic class numbers
HTML articles powered by AMS MathViewer

by Duncan A. Buell PDF
Math. Comp. 43 (1984), 313-327 Request permission

Abstract:

A method has been proposed for factoring an integer N by using the structure of the class groups of quadratic fields of radicand $- kN$ for various small multipliers k. We discuss the method and an implementation of the method, and various theoretical questions which have an impact on the practical use of the method in factoring. Some of the theoretical questions relate to the nature of class numbers and class groups; we present extensive statistical results on the class numbers and class groups of imaginary quadratic fields.
References
  • John Brillhart, D. H. Lehmer, J. L. Selfridge, Bryant Tuckerman, and S. S. Wagstaff Jr., Factorizations of $b^{n}\pm 1$, Contemporary Mathematics, vol. 22, American Mathematical Society, Providence, R.I., 1983. $b=2,\,3,\,5,\,6,\,7,\,10,\,11,\,12$ up to high powers. MR 715603
  • Duncan A. Buell, Class groups of quadratic fields, Math. Comp. 30 (1976), no. 135, 610–623. MR 404205, DOI 10.1090/S0025-5718-1976-0404205-X
  • Donald E. Knuth, The art of computer programming, 2nd ed., Addison-Wesley Series in Computer Science and Information Processing, Addison-Wesley Publishing Co., Reading, Mass.-London-Amsterdam, 1975. Volume 1: Fundamental algorithms. MR 0378456
    • Alexander M. Mood & Franklin A. Graybill, Introduction to the Theory of Statistics, 2nd ed., McGraw-Hill, New York, 1963, pp. 126-129. Carl Pomerance, private communication.
  • C. Pomerance, Analysis and comparison of some integer factoring algorithms, Computational methods in number theory, Part I, Math. Centre Tracts, vol. 154, Math. Centrum, Amsterdam, 1982, pp. 89–139. MR 700260
  • Carl Pomerance and Samuel S. Wagstaff Jr., Implementation of the continued fraction integer factoring algorithm, Congr. Numer. 37 (1983), 99–118. MR 703581
  • C.-P. Schnorr, A Monte Carlo factoring algorithm with finite storage, Seminar on Number Theory, 1981/1982, Univ. Bordeaux I, Talence, 1982, pp. Exp. No. 40, 16. Based on joint work with H. W. Lenstra, Jr. MR 695351
  • Daniel Shanks, Class number, a theory of factorization, and genera, 1969 Number Theory Institute (Proc. Sympos. Pure Math., Vol. XX, State Univ. New York, Stony Brook, N.Y., 1969) Amer. Math. Soc., Providence, R.I., 1971, pp. 415–440. MR 0316385
  • Horst G. Zimmer, Computational problems, methods, and results in algebraic number theory, Lecture Notes in Mathematics, Vol. 262, Springer-Verlag, Berlin-New York, 1972. MR 0323751, DOI 10.1007/BFb0058472
Similar Articles
Additional Information
  • © Copyright 1984 American Mathematical Society
  • Journal: Math. Comp. 43 (1984), 313-327
  • MSC: Primary 11Y05; Secondary 11A51, 11R29, 11Y40
  • DOI: https://doi.org/10.1090/S0025-5718-1984-0744940-1
  • MathSciNet review: 744940