ECM And The Elliott-Halberstam Conjecture For Quadratic Fields - Archive ouverte HAL Access content directly
Journal Articles Acta Arithmetica Year : 2024

ECM And The Elliott-Halberstam Conjecture For Quadratic Fields

Abstract

The complexity of the elliptic curve method of factorization (ECM) is proven under the celebrated conjecture of existence of smooth numbers in short intervals. In this work we tackle a different version of ECM which is actually much more studied and implemented, especially because it allows us to use ECM-friendly curves. In the case of curves with complex multiplication (CM) we replace the heuristics by rigorous results conditional to the Elliott-Halberstam (EH) conjecture. The proven results mirror recent theorems concerning the number of primes p such thar p − 1 is smooth. To each CM elliptic curve we associate a value which measures how ECM-friendly it is. In the general case we explore consequences of a statement which translated EH in the case of elliptic curves.
Fichier principal
Vignette du fichier
article.pdf (557.28 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03485435 , version 1 (17-12-2021)
hal-03485435 , version 2 (24-05-2022)
hal-03485435 , version 3 (22-12-2022)
hal-03485435 , version 4 (17-01-2023)

Identifiers

Cite

Razvan Barbulescu, Florent Jouve. ECM And The Elliott-Halberstam Conjecture For Quadratic Fields. Acta Arithmetica, In press. ⟨hal-03485435v4⟩
142 View
109 Download

Altmetric

Share

Gmail Facebook X LinkedIn More