An extension of Kedlaya's algorithm to superelliptic curves - Laboratoire d'informatique de l'école polytechnique Accéder directement au contenu
Communication Dans Un Congrès Année : 2001

An extension of Kedlaya's algorithm to superelliptic curves

Résumé

We present an algorithm for counting points on superelliptic curves y^r=f(x) over a finite field F_q of small characteristic different from r. This is an extension of an algorithm for hyperelliptic curves due to Kedlaya. In this extension, the complexity, assuming r and the genus are fixed, is O(log^{3+epsilon}q) in time and space, just like for hyperelliptic curves. We give some numerical examples obtained with our first implementation, thus proving that cryptographic sizes are now reachable.
Fichier principal
Vignette du fichier
asia01.pdf (240.6 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

inria-00514826 , version 1 (03-09-2010)

Identifiants

Citer

Pierrick Gaudry, Nicolas Gürel. An extension of Kedlaya's algorithm to superelliptic curves. Asiacrypt, 2001, Gold Coast, Australia. pp.480-494, ⟨10.1007/3-540-45682-1_28⟩. ⟨inria-00514826⟩
72 Consultations
98 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More