A Point Counting Algorithm for Cyclic Covers of the Projective Line - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Contemporary mathematics Année : 2015

A Point Counting Algorithm for Cyclic Covers of the Projective Line

Résumé

We present a Kedlaya-style point counting algorithm for cyclic covers $y^r = f(x)$ over a finite field $\mathbb{F}_{p^n}$ with $p$ not dividing $r$, and $r$ and $\deg{f}$ not necessarily coprime. This algorithm generalizes the Gaudry-Gürel algorithm for superelliptic curves to a more general class of curves, and has essentially the same complexity. Our practical improvements include a simplified algorithm exploiting the automorphism of $\mathcal{C}$, refined bounds on the $p$-adic precision, and an alternative pseudo-basis for the Monsky-Washnitzer cohomology which leads to an integral matrix when $p \geq 2r$. Each of these improvements can also be applied to the original Gaudry-Gürel algorithm. We include some experimental results, applying our algorithm to compute Weil polynomials of some large genus cyclic covers.
Fichier principal
Vignette du fichier
CecileGoncalvesPointCountingCyclicCovers.pdf (308.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01054645 , version 1 (07-08-2014)
hal-01054645 , version 2 (22-08-2014)

Identifiants

Citer

Cécile Gonçalves. A Point Counting Algorithm for Cyclic Covers of the Projective Line. Contemporary mathematics, 2015, Algorithmic Arithmetic, Geometry, and Coding Theory, 637, pp.145. ⟨hal-01054645v2⟩
459 Consultations
261 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More