Article contents
A ONE LINE FACTORING ALGORITHM
Published online by Cambridge University Press: 15 June 2012
Abstract
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.
MSC classification
- Type
- Research Article
- Information
- Copyright
- Copyright © Australian Mathematical Publishing Association Inc. 2012
References
- 5
- Cited by