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 2024 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.

 

Square form factorization
HTML articles powered by AMS MathViewer

by Jason E. Gower and Samuel S. Wagstaff Jr.;
Math. Comp. 77 (2008), 551-588
DOI: https://doi.org/10.1090/S0025-5718-07-02010-8
Published electronically: May 14, 2007
PDF | Request permission

Abstract:

We present a detailed analysis of SQUFOF, Daniel Shanks’ Square Form Factorization algorithm. We give the average time and space requirements for SQUFOF. We analyze the effect of multipliers, either used for a single factorization or when racing the algorithm in parallel.
References
  • Michael A. Morrison and John Brillhart, A method of factoring and the factorization of $F_{7}$, Math. Comp. 29 (1975), 183–205. MR 371800, DOI 10.1090/S0025-5718-1975-0371800-5
  • Duncan A. Buell, Binary quadratic forms, Springer-Verlag, New York, 1989. Classical theory and modern computations. MR 1012948, DOI 10.1007/978-1-4612-4542-1
  • Henri Cohen, A course in computational algebraic number theory, Graduate Texts in Mathematics, vol. 138, Springer-Verlag, Berlin, 1993. MR 1228206, DOI 10.1007/978-3-662-02945-9
  • Harvey Cohn, A second course in number theory, John Wiley & Sons, Inc., New York-London, 1962. MR 133281
  • Jason E. Gower. Square form factorization. Ph.D. thesis, Purdue University, December 2004.
  • David Joyner and Stephen McMath. http://cadigweb.ew.usna.edu/~wdj/mcmath/.
  • A. Ya. Khinchin, Continued fractions, University of Chicago Press, Chicago, Ill.-London, 1964. MR 161833
  • H. W. Lenstra Jr., On the calculation of regulators and class numbers of quadratic fields, Number theory days, 1980 (Exeter, 1980) London Math. Soc. Lecture Note Ser., vol. 56, Cambridge Univ. Press, Cambridge, 1982, pp. 123–150. MR 697260
  • J. S. Milne. Algebraic Number Theory, 1998. available at http://www.math.lsa.umich.edu/~jmilne.
  • Ivan Niven, Herbert S. Zuckerman, and Hugh L. Montgomery, An introduction to the theory of numbers, 5th ed., John Wiley & Sons, Inc., New York, 1991. MR 1083765
  • Hans Riesel, Prime numbers and computer methods for factorization, 2nd ed., Progress in Mathematics, vol. 126, Birkhäuser Boston, Inc., Boston, MA, 1994. MR 1292250, DOI 10.1007/978-1-4612-0251-6
  • D. Shanks. Analysis and Improvement of the Continued Fraction Method of Factorization. Abstract 720-10-43. Amer. Math. Soc. Notices, 22:A–68, 1975.
  • Daniel Shanks. An Attempt to Factor ${N}=1002742628021$. Manuscript, 3 pages, available at [6].
  • Daniel Shanks. Notes for Analysis and Improvement of the Continued Fraction Method of Factorization. Manuscript, 15 pages, available at [6].
  • Daniel Shanks. SQUFOF Notes. Manuscript, 30 pages, available at [6].
  • 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) Proc. Sympos. Pure Math., Vol. XX, Amer. Math. Soc., Providence, RI, 1971, pp. 415–440. MR 316385
  • Daniel Shanks, The infrastructure of a real quadratic field and its applications, Proceedings of the 1972 Number Theory Conference (Univ. Colorado, Boulder, Colo.), University of Colorado, Boulder, CO, 1972, pp. 217–224. MR 389842
  • Daniel Shanks, Five number-theoretic algorithms, Proceedings of the Second Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1972) Congress. Numer., No. VII, Utilitas Math., Winnipeg, MB, 1973, pp. 51–70. MR 371855
  • Samuel S. Wagstaff Jr., Cryptanalysis of number theoretic ciphers, Computational Mathematics Series, Chapman & Hall/CRC, Boca Raton, FL, 2003. MR 2000260
Similar Articles
Bibliographic Information
  • Jason E. Gower
  • Affiliation: Institute for Mathematics and its Applications, University of Minnesota, 424 Lind Hall, 207 Church St. S.E., Minneapolis, Minnesota 55455-0436
  • Email: gower@ima.umn.edu
  • Samuel S. Wagstaff Jr.
  • Affiliation: Center for Education and Research in Information Assurance and Security, and Department of Computer Science, Purdue University, West Lafayette, Indiana 47907
  • Email: ssw@cerias.purdue.edu
  • Received by editor(s): March 13, 2005
  • Received by editor(s) in revised form: November 9, 2006
  • Published electronically: May 14, 2007
  • Additional Notes: This paper is based on the Ph.D. thesis of the first author, supervised by the second author. Both authors are grateful for the support of the CERIAS Center at Purdue University and by the Lilly Endowment Inc.

    • Dedicated: This paper is dedicated to the memory of Daniel Shanks
  • © Copyright 2007 American Mathematical Society
    The copyright for this article reverts to public domain 28 years after publication.
  • Journal: Math. Comp. 77 (2008), 551-588
  • MSC (2000): Primary 11A51, 11E16, 11R11, 11Y05
  • DOI: https://doi.org/10.1090/S0025-5718-07-02010-8
  • MathSciNet review: 2353967