Faster deterministic integer factorization

DOI10.1090/S0025-5718-2013-02707-XzbMath1285.11148arXiv1201.2116OpenAlexW2033519499MaRDI QIDQ2862533

Edgar Costa, David I. Harvey

Publication date: 15 November 2013

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.2116

Mathematics Subject Classification ID

Number-theoretic algorithms; complexity (11Y16) Factorization (11Y05)

Related Items (13)

Deterministic root finding over finite fields using Graeffe transforms ⋮ A linear-time algorithm for the orbit problem over cyclic groups ⋮ A babystep-giantstep method for faster deterministic integer factorization ⋮ A log-log speedup for exponent one-fifth deterministic integer factorisation ⋮ Deterministic factoring with oracles ⋮ Integer factorization as subset-sum problem ⋮ Detecting squarefree numbers ⋮ Fast multivariate multi-point evaluation revisited ⋮ A deterministic algorithm for integer factorization ⋮ An exponent one-fifth algorithm for deterministic integer factorisation ⋮ A time-space tradeoff for Lehman’s deterministic integer factorization method ⋮ A Reduction of Integer Factorization to Modular Tetration ⋮ Deterministic factorization of sums and differences of powers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on computational complexity
• Faster Integer Multiplication
• On Schönhage's algorithm and subquadratic integer gcd computation
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
• A search for Wieferich and Wilson primes

This page was built for publication: Faster deterministic integer factorization