Fast computation of hyperelliptic curve isogenies in odd characteristic
Résumé
Let p be an odd prime number and g ≥ 2 be an integer. We present an algorithm for computing explicit rational representations of isogenies between Jacobians of hyperelliptic curves of genus g over an extension K of the field of p-adic numbers Qp. It relies on an efficient resolution, with a logarithmic loss of p-adic precision, of a first order system of differential equations.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|