Jump to content

Talk:Counting points on elliptic curves

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia

Outdated?

[edit]

This article is outdated/incomplete. It should mentions:

  1. Couveignes variant of SEA for fields of small characteristic (at the very least it should says that plain Elkies variant fails for small characteristic). [[1]]
  2. Sutherland algorithms for computing modular polynomials. [[2]]
  3. padic algorithms:
  • Satoh algorithm based on the canonical lift and the faster variants. A good reference is [[3]]
  • Kedlaya algorithm based on Monsky-Washnitzer cohomology. [[4]]
I feel that it is pretty relevant! it is pretty good!

On Extended Field

[edit]

The article and majar text deal with only the Finite Field, how to deal with the extended Field? Just add more  ?Jackzhp (talk) 13:37, 3 January 2018 (UTC)[reply]