BARBULESCU, Razvan; JOUVE, Florent

Metadatos

Mostrar el registro completo del ítem

Licencia de uso del documento

BARBULESCU, Razvan
Lithe and fast algorithmic number theory [LFANT]
Analyse cryptographique et arithmétique [CANARI]

JOUVE, Florent
Institut de Mathématiques de Bordeaux [IMB]

Idioma

Article de revue

Este ítem está publicado en

Acta Arithmetica. 2024

Instytut Matematyczny PAN

Fecha de defensa

2024

Resumen en inglés

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.< Leer menos

Palabras clave en inglés

Elliott-Halberstam conjecture

Elliptic curve method

Number field sieve

Metadatos

Compartir este ítem

Licencia de uso del documento

ECM And The Elliott-Halberstam Conjecture For Quadratic Fields

Idioma

Este ítem está publicado en

Fecha de defensa

Resumen en inglés

Palabras clave en inglés

URI

Orígen

Centros de investigación