A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Symbolic Computation Année : 2015

A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties

Résumé

In this paper, we use the theory of theta functions to generalize to all abelian varieties the usual Miller's algorithm to compute a function associated to a principal divisor. We also explain how to use the Frobenius morphism on abelian varieties defined over a finite field in order to shorten the loop of the Weil and Tate pairings algorithms. This extend preceding results about ate and twisted ate pairings to all abelian varieties. Then building upon the two preceding ingredients, we obtain a variant of optimal pairings on abelian varieties. Finally, by introducing new addition formulas, we explain how to compute optimal pairings on Kummer varieties. We compare in term of performance the resulting algorithms to the algorithms already known in the genus one and two case.
Fichier principal
Vignette du fichier
optimal_web.pdf (438.21 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00806923 , version 1 (02-04-2013)

Identifiants

Citer

David Lubicz, Damien Robert. A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties. Journal of Symbolic Computation, 2015, 67, pp.68-92. ⟨10.1016/j.jsc.2014.08.001⟩. ⟨hal-00806923⟩
407 Consultations
222 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More