Factoring Numbers with elliptic curves
Number Theory
2022-10-17 v2
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 .
Cite
@article{arxiv.2210.04835,
title = {Factoring Numbers with elliptic curves},
author = {Jorge Jimenez Urroz and Jacek Pomykala},
journal= {arXiv preprint arXiv:2210.04835},
year = {2022}
}