Pairing Lattices

DOI10.1007/978-3-540-85538-5_2zbMath1186.94444OpenAlexW2913147052MaRDI 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

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (27)

Faster Hashing to ${\mathbb G}_2$ ⋮ Optimal Eta Pairing on Supersingular Genus-2 Binary Hyperelliptic Curves ⋮ Faster Ate pairing computation on Selmer's model of elliptic curves ⋮ Further refinements of Miller's algorithm on Edwards curves ⋮ Efficient hash maps to \(\mathbb{G}_2\) on BLS curves ⋮ Pairing Computation on Edwards Curves with High-Degree Twists ⋮ Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ Self-pairings on supersingular elliptic curves with embedding degree \textit{three} ⋮ A survey of fault attacks in pairing based cryptography ⋮ Computing bilinear pairings on elliptic curves with automorphisms ⋮ Faster pairing computation on genus \(2\) hyperelliptic curves ⋮ Optimal pairing computation over families of pairing-friendly elliptic curves ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ The pairing computation on Edwards curves ⋮ Fixed argument pairing inversion on elliptic curves ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs ⋮ Efficient Self-pairing on Ordinary Elliptic Curves ⋮ Efficient Compression of SIDH Public Keys ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Pairing inversion for finding discrete logarithms ⋮ A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties ⋮ Polynomial generating pairing and its criterion for optimal pairing ⋮ Parallelizing the Weil and Tate Pairings ⋮ Efficient Pairing Computation on Ordinary Elliptic Curves of Embedding Degree 1 and 2 ⋮ Still wrong use of pairings in cryptography ⋮ Explicit formula for optimal ate pairing over cyclotomic family of elliptic curves

Cites Work

• 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
• Unnamed Item
• Unnamed Item

This page was built for publication: Pairing Lattices