A time-space tradeoff for Lehman’s deterministic integer factorization method

DOI10.1090/mcom/3623zbMath1472.11313arXiv2006.16729OpenAlexW3039251970MaRDI QIDQ4992239

Markus Hittmeir

Publication date: 7 June 2021

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

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

Mathematics Subject Classification ID

Factorization (11Y05)

Related Items (7)

A log-log speedup for exponent one-fifth deterministic integer factorisation ⋮ Deterministic factoring with oracles ⋮ Representing the integer factorization problem using ordered binary decision diagrams ⋮ Explicit methods in number theory. Abstracts from the workshop held July 18--24, 2021 (hybrid meeting) ⋮ On oracle factoring of integers ⋮ Integer factorization as subset-sum problem ⋮ An exponent one-fifth algorithm for deterministic integer factorisation

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some results on computational complexity
• Prime numbers and computer methods for factorization.
• Integer factoring
• Faster deterministic integer factorization
• A babystep-giantstep method for faster deterministic integer factorization
• Faster integer multiplication using plain vanilla FFT primes
• Factoring Large Integers
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator

This page was built for publication: A time-space tradeoff for Lehman’s deterministic integer factorization method