Pairing Lattices

DOI10.1007/978-3-540-85538-5_2zbMath1186.94444MaRDI QIDQ3600491

Florian Hess

Publication date: 10 February 2009

Published in: Pairing-Based Cryptography – Pairing 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_2

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

14G50: Applications to coding theory and cryptography of arithmetic geometry

Related Items

Efficient Self-pairing on Ordinary Elliptic Curves, Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs, Self-pairings on supersingular elliptic curves with embedding degree \textit{three}, Optimal pairing computation over families of pairing-friendly elliptic curves, The pairing computation on Edwards curves, Computing bilinear pairings on elliptic curves with automorphisms, A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties, Polynomial generating pairing and its criterion for optimal pairing, Faster pairing computation on genus \(2\) hyperelliptic curves, A taxonomy of pairing-friendly elliptic curves, Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves, Faster Hashing to ${\mathbb G}_2$, Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves, Parallelizing the Weil and Tate Pairings, Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2

Cites Work

• Unnamed Item
• Unnamed Item
• The Weil pairing, and its efficient calculation
• Efficient pairing computation on supersingular abelian varieties
• The Eta Pairing Revisited
• Optimised Versions of the Ate and Twisted Ate Pairings
• Faster Pairings Using an Elliptic Curve with an Efficient Endomorphism