A babystep-giantstep method for faster deterministic integer factorization

@article{Hittmeir2018ABM,
  title={A babystep-giantstep method for faster deterministic integer factorization},
  author={Markus Hittmeir},
  journal={Math. Comput.},
  year={2018},
  volume={87},
  pages={2915-2935}
}
  • Markus Hittmeir
  • Published 2018
  • Mathematics, Computer Science
  • Math. Comput.
  • In 1977, Strassen presented a deterministic and rigorous algorithm for solving the problem of computing the prime factorization of natural numbers $N$. His method is based on fast polynomial arithmetic techniques and runs in time $\widetilde{O}(N^{1/4})$, which has been state of the art for the last forty years. In this paper, we will combine Strassen's approach with a babystep-giantstep method to improve the currently best known bound by a superpolynomial factor. The runtime complexity of our… CONTINUE READING
    6 Citations

    Topics from this paper.

    A time-space tradeoff for Lehman's deterministic integer factorization method
    • 1
    • PDF
    An exponent one-fifth algorithm for deterministic integer factorisation
    • D. Harvey
    • Mathematics, Computer Science
    • ArXiv
    • 2020
    Canonical form of modular hyperbolas with an application to integer factorization
    Faster computation of isogenies of large prime degree
    • 10
    • PDF
    On oracle factoring of integers
    • 1
    • PDF
    A Reduction of Integer Factorization to Modular Tetration
    • Markus Hittmeir
    • Mathematics, Computer Science
    • Int. J. Found. Comput. Sci.
    • 2020
    • 1
    • PDF

    References

    SHOWING 1-10 OF 20 REFERENCES
    Faster integer multiplication
    • M. Fürer
    • Mathematics, Computer Science
    • STOC '07
    • 2007
    • 206
    Even faster integer multiplication
    • 77
    • PDF
    Deterministic factorization of sums and differences of powers
    • 1
    • PDF
    Order computations in generic groups
    • 41
    • Highly Influential
    • PDF
    Faster deterministic integer factorization
    • 18
    • PDF
    Prime numbers and computer methods for factorization
    • 442
    The Joy of Factoring
    • 12
    Approximate formulas for some functions of prime numbers
    • 1,416
    • PDF
    A computational introduction to number theory and algebra
    • V. Shoup
    • Mathematics, Computer Science
    • 2005
    • 516
    • PDF