On oracle factoring of integers

DOI10.1016/j.jco.2023.101741OpenAlexW2991533092MaRDI QIDQ2693692

Andrzej Dąbrowski, Igor E. Shparlinski, Jacek Pomykała

Publication date: 24 March 2023

Published in: Journal of Complexity (Search for Journal in Brave)

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

zbMATH Keywords

oracleinteger factorisation problem

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Factorization (11Y05)

Related Items (3)

Factoring integers and oracles for elliptic and hyperelliptic curves ⋮ Smooth factors of integers and elliptic curve based factoring with an oracle ⋮ Signatures of Dirichlet characters and elliptic curves

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A remark on the least \(n\) with \(\chi(n) \not= 1\)
• Factoring integers with elliptic curves
• Nonsingular plane cubic curves over finite fields
• Riemann's hypothesis and tests for primality
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• Rigorous analysis of a randomised number field sieve
• On the oracle complexity of factoring integers
• Integer factoring and compositeness witnesses
• Implicit factorization of unbalanced RSA moduli
• Improved bounds for the implicit factorization problem
• A note on Mertens' formula for arithmetic progressions
• The least quadratic non residue
• Integer multiplication in time \(O(n\log n)\)
• Towards Optimal Bounds for Implicit Factorization Problem
• ON THE LEAST QUADRATIC NON-RESIDUE
• Implicit Factoring: On Polynomial Time Factoring Given Only an Implicit Hint
• The Arithmetic of Elliptic Curves
• 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
• Integer factoring problem and elliptic curves over the ring $\mathbb Z_n$
• Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)

This page was built for publication: On oracle factoring of integers