An exponent one-fifth algorithm for deterministic integer factorisation
From MaRDI portal
Publication:4956932
DOI10.1090/mcom/3658zbMath1472.11311arXiv2010.05450OpenAlexW3156290661MaRDI QIDQ4956932
Publication date: 2 September 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.05450
Related Items
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 ⋮ On oracle factoring of integers ⋮ Integer factorization as subset-sum problem ⋮ Supersingular j-invariants and the class number of ℚ(−p)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on computational complexity
- Small solutions to polynomial equations, and low exponent RSA vulnerabilities
- On the complexity of integer matrix multiplication
- Integer multiplication in time \(O(n\log n)\)
- Faster deterministic integer factorization
- Modern Computer Algebra
- Modern Computer Arithmetic
- A babystep-giantstep method for faster deterministic integer factorization
- A Rigorous Time Bound for Factoring Integers
- Monte Carlo Methods for Index Computation (mod p)
- Factoring Large Integers
- A time-space tradeoff for Lehman’s deterministic integer factorization method
- Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator
