William Bruce Hart

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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(More)
  • 1