Skip to content

Efficient pairing computation with theta functions

Citations of this article
Mendeley users who have this article in their library.
Get full text


In this paper, we present a new approach based on theta functions to compute Weil and Tate pairings. A benefit of our method, which does not rely on the classical Miller's algorithm, is its generality since it extends to all abelian varieties the classical Weil and Tate pairing formulas. In the case of dimension 1 and 2 abelian varieties our algorithms lead to implementations which are efficient and naturally deterministic. We also introduce symmetric Weil and Tate pairings on Kummer varieties and explain how to compute them efficiently. We exhibit a nice algorithmic compatibility between some algebraic groups quotiented by the action of the automorphism -1, where the Z-action can be computed efficiently with a Montgomery ladder type algorithm. © 2010 Springer-Verlag Berlin Heidelberg.




Lubicz, D., & Robert, D. (2010). Efficient pairing computation with theta functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6197 LNCS, pp. 251–269).

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free