On oracle factoring of integers

Abstract

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

    Similar works

    Full text

    thumbnail-image

    Available Versions