Abstract
For an elliptic curve E/Q without complex multiplication we study the distribution of Atkin and Elkies primes ℓ, on average, over all good reductions of E modulo primes p. We show that, under the generalized Riemann hypothesis, for almost all primes p there are enough small Elkies primes ℓ to ensure that the Schoof-Elkies-Atkin point-counting algorithm runs in (log p)4+o(1) expected time.
| Original language | English |
|---|---|
| Pages (from-to) | 308-322 |
| Number of pages | 15 |
| Journal | LMS Journal of Computation and Mathematics |
| Volume | 18 |
| Issue number | 1 |
| DOIs | |
| Publication status | Published - 10 Apr 2015 |
| Externally published | Yes |
Fingerprint
Dive into the research topics of 'On the distribution of Atkin and Elkies primes for reductions of elliptic curves on average'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver