Counting points in medium characteristic using Kedlaya's algorithm - Laboratoire d'informatique de l'école polytechnique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2003

Counting points in medium characteristic using Kedlaya's algorithm

Résumé

Recently, many new results have been found concerning algorithms for counting points on curves over finite fields of characteristic p, mostly due to the use of p-adic liftings. The complexity of these new methods is exponential in p therefore they behave well when p is small, the ideal case being p=2. When applicable, these new methods are usually faster than those based on SEA algorithms, and are more easily extended to non-elliptic curves. We investigate more precisely this dependance on the characteristic, and in particular, we show that after a few modifications using fast algorithms for radix-conversion, Kedlaya's algorithm works in time almost linear in p. As a consequence, this algorithm can also be applied to medium values of p. We give an example of a cryptographic size genus 3 hyperelliptic curve over a finite field of characteristic 251.

Domaines

Autre [cs.OH]
Fichier principal
Vignette du fichier
RR-4838.pdf (305.54 Ko) Télécharger le fichier

Dates et versions

inria-00071747 , version 1 (23-05-2006)

Identifiants

  • HAL Id : inria-00071747 , version 1

Citer

Pierrick Gaudry, Nicolas Gürel. Counting points in medium characteristic using Kedlaya's algorithm. [Research Report] RR-4838, INRIA. 2003. ⟨inria-00071747⟩
95 Consultations
262 Téléchargements

Partager

Gmail Facebook X LinkedIn More