Efficient pairing computation with theta functions

DOI10.1007/978-3-642-14518-6_21MaRDI QIDQ4931653zbMATH OpenOpenAlexFDO

Authors David Lubicz, Damien Robert

Publication date 29 September 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14518-6_21

Mathematics Subject Classification ID

Abelian varieties of dimension (> 1) (11G10) Algebraic theory of abelian varieties (14K05) Theta functions and abelian varieties (14K25)

Recommendations

• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
• Faster computation of the Tate pairing
• Efficient pairing computation on supersingular abelian varieties
• Algorithmic Number Theory
• Computing isogenies between abelian varieties

Cited in

(20)

• Accelerating beta Weil pairing with precomputation and multi-pairing techniques
• Arithmetic of the level four theta model of elliptic curves
• Fast change of level and applications to isogenies
• Arithmetic on abelian and Kummer varieties
• Side channel attacks against pairing over theta functions
• Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves
• A multilinear generalization of the Tate pairing
• Pairing Lattices
• Computing separable isogenies in quasi-optimal time
• Computing (\ell ,\ell )-isogenies in polynomial time on Jacobians of genus 2 curves
• EFFICIENT PAIRING FUNCTIONS — AND WHY YOU SHOULD CARE
• Breaking SIDH in polynomial time
• Computing modular correspondences for abelian varieties
• Effective pairings in isogeny-based cryptography
• The Tate profile
• Efficient theta-based algorithms for computing ( , )-isogenies on Kummer surfaces for arbitrary odd
• On the efficient representation of isogenies. A survey for NuTMiC 2024
• A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties
• Complete addition formulas on the level four theta model of elliptic curves
• A survey of fault attacks in pairing based cryptography

This page was built for publication: Efficient pairing computation with theta functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4931653)