arXiv · 1911.11004
Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N
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.
Explore related subjects
Keep this discovery
Luis Dieulefait, Jorge Urroz. 2019-11-25. Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N. https://arxiv.org/abs/1911.11004
Cite the original work for its findings. Save a collection to share your selection of sources.