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

DOI10.1016/J.JSC.2014.08.001MaRDI QIDQ741253zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

abelian varietiesMiller's algorithmTate pairingpairing computationWeil pairing

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 3396076 (Why is no real title available?)
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Ate Pairing on Hyperelliptic Curves
• Bilinear pairings on elliptic curves
• Computing $(\ell ,\ell )$-isogenies in polynomial time on Jacobians of genus $2$ curves
• Computing pairings using x-coordinates only
• Duality theorems for curves over p-adic fields
• Efficient pairing computation on supersingular abelian varieties
• Efficient pairing computation with theta functions
• Equations for the Jacobian of a hyperelliptic curve
• Fast genus 2 arithmetic based on Theta functions
• Faster computation of the Tate pairing
• Faster pairing computations on curves with high-degree twists
• Formulae for arithmetic on genus 2 hyperelliptic curves
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Hyperelliptic Pairings
• On the equations defining Abelian varieties. I-III
• Optimal Pairings
• Pairing Lattices
• Reciprocity and Correspondences
• 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
• 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 Eta Pairing Revisited
• The Weil pairing, and its efficient calculation
• The arithmetic of characteristic 2 Kummer surfaces and of elliptic Kummer lines
• Theta Relations and Projective Normality of Abelian Varieties
• Varieties Defined by Quadratic Equations

Cited in

(15)

• Effective pairings in isogeny-based cryptography
• Breaking SIDH in polynomial time
• Computing separable isogenies in quasi-optimal time
• 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

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)