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

Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [29 references]  Display  Hide  Download

https://hal.inria.fr/hal-00806923
Contributor : Damien Robert <>
Submitted on : Tuesday, April 2, 2013 - 3:52:57 PM
Last modification on : Wednesday, February 13, 2019 - 4:06:06 PM
Document(s) archivé(s) le : Wednesday, July 3, 2013 - 4:08:10 AM

File

optimal_web.pdf
Files produced by the author(s)

Identifiers

Citation

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

Share

Metrics

Record views

717

Files downloads

252