On Compressible Pairings and Their Computation

DOI10.1007/978-3-540-68164-9_25zbMath1142.94353OpenAlexW2145445094MaRDI QIDQ3506394

Michael Naehrig, Peter Schwabe, Paulo S. L. M. Barreto

Publication date: 13 June 2008

Published in: Progress in Cryptology – AFRICACRYPT 2008 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68164-9_25

zbMATH Keywords

twistsTate pairingpairing-based cryptographyAte pairingEta pairingalgebraictoricompressible pairings

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Effective compression maps for torus-based cryptography ⋮ Higher-Order Side Channel Security and Mask Refreshing ⋮ Dory: efficient, transparent arguments for generalised inner products and polynomial commitments ⋮ Efficient Multiplication in Finite Field Extensions of Degree 5 ⋮ A taxonomy of pairing-friendly elliptic curves ⋮ Computing pairings using \(x\)-coordinates only ⋮ On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings

Cites Work

• A taxonomy of pairing-friendly elliptic curves
• Efficient pairing computation on supersingular abelian varieties
• On Small Characteristic Algebraic Tori in Pairing-Based Cryptography
• The Eta Pairing Revisited
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Efficient and Generalized Pairing Computation on Abelian Varieties
• Advances in Cryptology – CRYPTO 2004
• Pairing-Friendly Elliptic Curves of Prime Order
• Advances in Cryptology - CRYPTO 2003
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Optimised Versions of the Ate and Twisted Ate Pairings