Abstract
The heart of the improvements by Elkies to Schoof's algorithm for computing the cardinality of elliptic curves over a finite field is the ability to compute isogenies between curves. Elkies' approach is well suited for the case where the characteristic of the field is large. Couveignes showed how to compute isogenies in small characteristic. The aim of this paper is to describe the first successful implementation of Couveignes's algorithm. In particular, we describe the use of fast algorithms for performing incremental operations on series. We also insist on the particular case of the characteristic 2.
| Original language | English |
|---|---|
| Pages (from-to) | 351-370 |
| Number of pages | 20 |
| Journal | Mathematics of Computation |
| Volume | 69 |
| Issue number | 229 |
| DOIs | |
| Publication status | Published - 1 Jan 2000 |
Keywords
- Elliptic curves
- Finite fields
- Formal groups
- Isogenies
- Schoof's algorithm