Factoring Numbers with elliptic curves
Jorge Jimenez Urroz, Jacek Pomykala

TL;DR
This paper introduces a probabilistic polynomial-time algorithm that reduces the problem of factoring squarefree integers to counting points on elliptic curves modulo n, with high success probability.
Contribution
It presents a novel reduction from integer factorization to elliptic curve point counting, advancing computational number theory methods.
Findings
Algorithm operates in probabilistic polynomial time.
Successfully reduces factorization to elliptic curve point counting.
Achieves high probability of success for the reduction.
Abstract
In the present paper we provide a probabilistic polynomial time algorithm that reduces the complete factorization of any squarefree integer to counting points on elliptic curves modulo , succeeding with probability , for any .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Analytic Number Theory Research · Cryptography and Residue Arithmetic
