Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

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



Faster deterministic integer factorization

Authors: Edgar Costa and David Harvey
Journal: Math. Comp. 83 (2014), 339-345
MSC (2010): Primary 11Y05
Published electronically: May 7, 2013
MathSciNet review: 3120593
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: The best known unconditional deterministic complexity bound for computing the prime factorization of an integer $ N$ is $ O(\mathsf M_{\text {\rm int}}(N^{1/4} \log N))$, where $ \mathsf M_{\text {\rm int}}(k)$ denotes the cost of multiplying $ k$-bit integers. This result is due to Bostan, Gaudry, and Schost, following the Pollard-Strassen approach. We show that this bound can be improved by a factor of $ \sqrt {\log \log N}$.

References [Enhancements On Off] (What's this?)

  • [BGS07] Alin Bostan, Pierrick Gaudry, and Éric Schost.
    Linear recurrences with polynomial coefficients and application to integer factorization and Cartier-Manin operator.
    SIAM J. Comput., 36(6):1777-1806, 2007. MR 2299425 (2008a:11156)
  • [CDP97] Richard Crandall, Karl Dilcher, and Carl Pomerance.
    A search for Wieferich and Wilson primes.
    Math. Comp., 66(217):433-449, 1997. MR 1372002 (97c:11004)
  • [CP05] Richard Crandall and Carl Pomerance.
    Prime numbers.
    Springer, New York, second edition, 2005.
    A computational perspective. MR 2156291 (2006a:11005)
  • [Für09] Martin Fürer.
    Faster integer multiplication.
    SIAM J. Comput., 39(3):979-1005, 2009. MR 2538847 (2011b:68296)
  • [Möl08] Niels Möller.
    On Schönhage's algorithm and subquadratic integer GCD computation.
    Math. Comp., 77(261):589-607 (electronic), 2008. MR 2353968 (2008h:11004)
  • [MV07] Hugh L. Montgomery and Robert C. Vaughan.
    Multiplicative number theory. I. Classical theory, volume 97 of Cambridge Studies in Advanced Mathematics.
    Cambridge University Press, Cambridge, 2007. MR 2378655 (2009b:11001)
  • [Pap94] Christos H. Papadimitriou.
    Computational complexity.
    Addison-Wesley Publishing Company, Reading, MA, 1994. MR 1251285 (95f:68082)
  • [Pol74] J. M. Pollard.
    Theorems on factorization and primality testing.
    Proc. Cambridge Philos. Soc., 76:521-528, 1974. MR 0354514 (50:6992)
  • [Sch82] Arnold Schönhage.
    Asymptotically fast algorithms for the numerical multiplication and division of polynomials with complex coefficients.
    In Computer algebra (Marseille, 1982), volume 144 of Lecture Notes in Comput. Sci., pages 3-15. Springer, Berlin, 1982. MR 680048 (83m:68064)
  • [Str77] Volker Strassen.
    Einige Resultate über Berechnungskomplexität.
    Jber. Deutsch. Math.-Verein., 78(1):1-8, 1976/77. MR 0438807 (55:11713)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC (2010): 11Y05

Retrieve articles in all journals with MSC (2010): 11Y05

Additional Information

Edgar Costa
Affiliation: Courant Institute of Mathematical Sciences, New York University, 251 Mercer Street, New York, New York 10012-1185

David Harvey
Affiliation: School of Mathematics and Statistics, University of New South Wales, Sydney NSW 2052, Australia

Received by editor(s): January 31, 2012
Received by editor(s) in revised form: April 14, 2012
Published electronically: May 7, 2013
Additional Notes: The first author was partially supported by FCT doctoral grant SFRH/BD/69914/2010.
The second author was partially supported by the Australian Research Council, DECRA Grant DE120101293.
Article copyright: © Copyright 2013 by the authors

American Mathematical Society