Factoring numbers with elliptic curves

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 \) $1-\epsilon$ , for any \(\varepsilon >0\) $\epsilon >0$ .