We present an oracle factorisation algorithm which finds a nontrivial factor of almost all positive integers $n$ based on the knowledge of the number of points on certain elliptic curves in residue rings modulo $n$.

翻译：我们提出一种神谕分解算法，该算法基于对模$n$剩余环上某些椭圆曲线上的点数知识，能够找出几乎所有正整数$n$的非平凡因子。