Smooth factors of integers and elliptic curve based factoring with an oracle

DOI10.4064/bc126-5OpenAlexW4389083223MaRDI QIDQ6196947

Jacek Pomykała, Robert Dryło

Publication date: 15 March 2024

Published in: Banach Center Publications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/bc126-5

zbMATH Keywords

elliptic curveL-functiondeterministic algorithmInteger factorizationFrobenius traces modulo primes

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05) Elliptic curves over local fields (11G07) Factorization (11Y05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Factoring integers with elliptic curves
• Small solutions to polynomial equations, and low exponent RSA vulnerabilities
• On the oracle complexity of factoring integers
• On oracle factoring of integers
• Efficient CM-constructions of elliptic curves over finite fields
• The Arithmetic of Elliptic Curves
• Factoring Large Integers
• Integer factoring problem and elliptic curves over the ring $\mathbb Z_n$
• Conditional bounds for the least quadratic non-residue and related problems
• Computing the order of points on an elliptic curve modulo \(N\) is as difficult as factoring \(N\)

This page was built for publication: Smooth factors of integers and elliptic curve based factoring with an oracle