Hostname: page-component-cd9895bd7-gbm5v Total loading time: 0 Render date: 2024-12-25T09:21:59.609Z Has data issue: false hasContentIssue false
  • English
  • Français

A ONE LINE FACTORING ALGORITHM

Part of: Elementary number theory

Published online by Cambridge University Press:  15 June 2012

WILLIAM B. HART
WILLIAM B. HART*
Affiliation:
Zeeman Building, University of Warwick, Coventry CV4 7AL, UK (email: [email protected])
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We describe a variant of Fermat’s factoring algorithm which is competitive with SQUFOF in practice but has heuristic run time complexity O(n1/3) as a general factoring algorithm. We also describe a sparse class of integers for which the algorithm is particularly effective. We provide speed comparisons between an optimised implementation of the algorithm described and the tuned assortment of factoring algorithms in the Pari/GP computer algebra package.

Keywords

integer factorisationLehman’s algorithmFermat’s algorithm

MSC classification

Secondary: 11A51: Factorization; primality
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 92 , Issue 1 , February 2012 , pp. 61 - 69
Copyright
Copyright © Australian Mathematical Publishing Association Inc. 2012

References

[1]Dixon, J. D., ‘Asymptotically fast factorization of integers’, Math. Comp. 36 (1981), 255–260.CrossRefGoogle Scholar
[2]Gower, J. and Wagstaff, S. Jr, ‘Square form factorization’, Math. Comp. 77 (2008), 551–588.CrossRefGoogle Scholar
[3]Hart, W., ‘FLINT: Fast Library for Number Theory’, http://www.flintlib.org.Google Scholar
[4]Lehman, R., ‘Factoring large integers’, Math. Comp. 28 (1974), 637–646.CrossRefGoogle Scholar
[5]McKee, J., ‘Speeding Fermat’s factoring method’, Math. Comp. 68 (1999), 1729–1737.CrossRefGoogle Scholar
[6] The Pari Group, ‘Pari/GP’, http://pari.math.u-bordeaux.fr/.Google Scholar
[7]Shanks, D., ‘On Gauss and Composition II’, in: Number Theory and Applications (Banff, AB, 1988), NATO Adv. Sci. Inst. Ser. C Math. Phys. Sci., 265 (ed. Mollin, R. A.) (Kluwer, Dordrecht, 1989), pp. 179–204.Google Scholar
[8]Stein, W., ‘Can we create a viable free open source alternative to Magma, Maple, Mathematica and Matlab?’ Proc. ISSAC 2008, Hagenberg, Austria, 20–23 July, 2008 (eds. J. R. Sendra and L. González-Vega) (ACM, New York, 2008), pp. 5–6. See also http://www.sagemath.org/.CrossRefGoogle Scholar