arXiv · 2210.04835
Factoring Numbers with elliptic curves
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$ .
Explore related subjects
Keep this discovery
Jorge Jimenez Urroz, Jacek Pomykala. 2022-10-10. Factoring Numbers with elliptic curves. https://arxiv.org/abs/2210.04835
Cite the original work for its findings. Save a collection to share your selection of sources.