R.I.P.
👻
Ghosted
Factorization and malleability of RSA modules, and counting points on elliptic curves modulo N
November 25, 2019 · Declared Dead · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Luis Dieulefait, Jorge Urroz
arXiv ID
1911.11004
Category
math.NT
Cross-listed
cs.IT
Citations
0
Venue
arXiv.org
Last Checked
1 month ago
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — math.NT
R.I.P.
👻
Ghosted
An analogue of Vosper's Theorem for Extension Fields
R.I.P.
👻
Ghosted
Improved torsion point attacks on SIDH variants
R.I.P.
👻
Ghosted
Ramanujan graphs in cryptography
R.I.P.
👻
Ghosted
Locally Recoverable Codes with Availability $t\geq 2$ from Fiber Products of Curves
R.I.P.
👻
Ghosted
Failing to hash into supersingular isogeny graphs
Died the same way — 👻 Ghosted
R.I.P.
👻
Ghosted
Language Models are Few-Shot Learners
R.I.P.
👻
Ghosted
PyTorch: An Imperative Style, High-Performance Deep Learning Library
R.I.P.
👻
Ghosted
XGBoost: A Scalable Tree Boosting System
R.I.P.
👻
Ghosted