Computing isogenies between elliptic curves over Fpn using Couveignes's algorithm

Research output: Contribution to journalArticlepeer-review

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 languageEnglish
Pages (from-to)351-370
Number of pages20
JournalMathematics of Computation
Volume69
Issue number229
DOIs
Publication statusPublished - 1 Jan 2000

Keywords

  • Elliptic curves
  • Finite fields
  • Formal groups
  • Isogenies
  • Schoof's algorithm

Fingerprint

Dive into the research topics of 'Computing isogenies between elliptic curves over Fpn using Couveignes's algorithm'. Together they form a unique fingerprint.

Cite this