论文标题
用椭圆曲线分解数字
Factoring Numbers with elliptic curves
论文作者
论文摘要
在本文中，我们提供了一种概率的多项式时间算法，该算法将任何无方体整数$ n $的完全分解降低到椭圆曲线模量$ n $上的计数点，以$ 1- \ varepsilon $的概率为$ \ varepsilon $。
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$ .
