Faster deterministic integer factorization

DOI10.1090/S0025-5718-2013-02707-XzbMath1285.11148arXiv1201.2116MaRDI 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

11Y16: Number-theoretic algorithms; complexity

11Y05: Factorization

Related Items

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

Cites Work

• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item