Computing isogenies between elliptic curves over $GF(p^n)$ using Couveignes's algorithm - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Mathematics of Computation Année : 2000

Computing isogenies between elliptic curves over $GF(p^n)$ using Couveignes's algorithm

Résumé

The heart of the improvements of 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.

Dates et versions

hal-01102025 , version 1 (11-01-2015)

Identifiants

Citer

Reynald Lercier, François Morain. Computing isogenies between elliptic curves over $GF(p^n)$ using Couveignes's algorithm. Mathematics of Computation, 2000, 69 (229), pp.351-370. ⟨10.1090/S0025-5718-99-01081-9⟩. ⟨hal-01102025⟩
700 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More