# Efficient pairing computation with theta functions

2 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : 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.

Cited literature [15 references]

https://hal.archives-ouvertes.fr/hal-00528944
Contributor : Damien Robert <>
Submitted on : Saturday, October 23, 2010 - 12:38:04 AM
Last modification on : Tuesday, December 18, 2018 - 4:18:25 PM
Document(s) archivé(s) le : Friday, October 26, 2012 - 12:00:50 PM

### File

pairing_short.pdf
Files produced by the author(s)

### Citation

David Lubicz, Damien Robert. Efficient pairing computation with theta functions. ANTS IX - Algorithmic Number Theory 2010, Jul 2010, Nancy, France. pp.251-269, ⟨10.1007/978-3-642-14518-6_21⟩. ⟨hal-00528944⟩

Record views