Reynald Lercier

[fr]  [en]

Welcome  





Adresse DGA MI

Route de Laillé

35170 Bruz

Adresse

Université de Rennes 1

IRMAR

Équipe Géométrie Algébrique Réelle, Calcul Formel et Cryptographie

Room 612

 

Fax33 2 99 42 64 50
Melreynald.lercier (at) m4x.org
  • open
    close
    Publications
    • • Papers
    • • Talks
  • open
    close
    Software
    • • Magma
  • open
    close
    Computations
    • • Discrete logarithms
    • • Counting points on elliptic curves
    • • Elliptic curves of prescribed order
    • • Counting points on hyperelliptic curves
    • • Integer factorization
Links
ZEN IRMAR
[LM00]

R. Lercier and F. Morain. Computing isogenies between elliptic curves over GF(pn) using Couveignes's algorithm. Mathematics of Computation, 69(229):351-370, January 2000.

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.

[ bib | preprint | publication ] Back

Top


  Site powered by GuppY v4.5.14 © 2004-2005 - CeCILL Free License