A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
DOI10.1016/J.JSC.2014.08.001zbMATH Open1304.14056OpenAlexW2058959764MaRDI QIDQ741253FDOQ741253
Authors: David Lubicz, Damien Robert
Publication date: 11 September 2014
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jsc.2014.08.001
Recommendations
- Efficient pairing computation with theta functions
- The Weil pairing, and its efficient calculation
- Ate Pairing on Hyperelliptic Curves
- Refinements of Miller's algorithm for computing the Weil/Tate pairing
- Further refinement of pairing computation based on Miller's algorithm
- Algorithmic Number Theory
- Refinement of Miller's algorithm over Edwards curves
- Efficient pairing computation on supersingular abelian varieties
- A variant of Miller's formula and algorithm
- Efficient pairing computation on curves
Cryptography (94A60) Theta functions and abelian varieties (14K25) Finite ground fields in algebraic geometry (14G15) Elliptic curves (14H52) Arithmetic ground fields for abelian varieties (14K15)
Cites Work
- Tata lectures on theta. I: Introduction and motivation: Theta functions in one variable. Basic results on theta functions in several variables. With the assistance of C. Musili, M. Nori, E. Previato, and M. Stillman
- Title not available (Why is that?)
- The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Faster computation of the Tate pairing
- On the equations defining Abelian varieties. I-III
- Theta Relations and Projective Normality of Abelian Varieties
- Efficient pairing computation with theta functions
- Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
- Fast genus 2 arithmetic based on Theta functions
- Varieties Defined by Quadratic Equations
- Title not available (Why is that?)
- Tata lectures on theta. II: Jacobian theta functions and differential equations. With the collaboration of C. Musili, M. Nori, E. Previato, M. Stillman, and H. Umemura
- The Weil pairing, and its efficient calculation
- Efficient pairing computation on supersingular abelian varieties
- The Eta Pairing Revisited
- Faster pairing computations on curves with high-degree twists
- Pairing Lattices
- Optimal Pairings
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Duality theorems for curves over p-adic fields
- Ate Pairing on Hyperelliptic Curves
- A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
- Computing pairings using \(x\)-coordinates only
- Reciprocity and Correspondences
- Equations for the Jacobian of a hyperelliptic curve
- Hyperelliptic Pairings
- Bilinear pairings on elliptic curves
Cited In (15)
- A Generalized Brezing-Weng Algorithm for Constructing Pairing-Friendly Ordinary Abelian Varieties
- Arithmetic on abelian and Kummer varieties
- Cyclic isogenies for abelian varieties with real multiplication
- Delaying mismatched field multiplications in pairing computations
- Efficient pairing computation with theta functions
- The Weil pairing, and its efficient calculation
- Jacobian coordinates on genus 2 curves
- Efficient pairing computation on supersingular abelian varieties
- A variant of Miller's formula and algorithm
- Further refinement of pairing computation based on Miller's algorithm
- Integer Variable χ–Based Ate Pairing
- AN ANALYTIC PERSPECTIVE OF WEIL RECIPROCITY
- Effective pairings in isogeny-based cryptography
- Breaking SIDH in polynomial time
- Computing separable isogenies in quasi-optimal time
This page was built for publication: A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741253)