Factoring Numbers with elliptic curves

DOI10.1007/S11139-023-00822-1MaRDI QIDQ6413473zbMATH OpenOpenAlexFDO

Authors Jorge Jiménez Urroz, Jacek Pomykała

Publication date 10 October 2022

Full work available at URL https://doi.org/10.1007/s11139-023-00822-1

Mathematics Subject Classification ID

Factorization; primality (11A51) Elliptic curves over local fields (11G07)

Abstract: In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer $n$ to counting points on elliptic curves modulo $n$, succeeding with probability $1-varepsilon$, for any $varepsilon<0$ .

Recommendations

• Factoring integers with elliptic curves
• scientific article; zbMATH DE number 3959522
• Integer factoring problem and elliptic curves over the ring \(\mathbb Z_n\)
• scientific article; zbMATH DE number 5281877
• Speeding the Pollard and Elliptic Curve Methods of Factorization

Cited in

(3)

• Factorization, malleability and equivalent problems
• Isotropic vectors over global fields
• Elliptic-curve factoring, witnesses and oracles

This page was built for publication: Factoring Numbers with elliptic curves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6413473)