2000 character limit reached
Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N (1911.11004v1)
Published 25 Nov 2019 in math.NT, cs.IT, and math.IT
Abstract: In this paper we address two different problems related with the factorization of an RSA module N. First we can show that factoring is equivalent in deterministic polynomial time to counting points on a pair of twisted Elliptic curves modulo N. Also we settle the malleability of factoring an RSA module, as described in [9], using the number of points of a single elliptic curve modulo N, and Coppersmith's algorithm.