Optimised Versions of the Ate and Twisted Ate Pairings

DOI10.1007/978-3-540-77272-9_18zbMath1154.94416OpenAlexW1544438321MaRDI QIDQ5448545

Naoki Kanayama, Seiichi Matsuda, Florian Hess, Eiji Okamoto

Publication date: 7 March 2008

Published in: Cryptography and Coding (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Elliptic curves (14H52)

Related Items

Implementing optimized pairings with elliptic nets, On Compressible Pairings and Their Computation, Computing bilinear pairings on elliptic curves with automorphisms, Optimal pairing computation over families of pairing-friendly elliptic curves, An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication, Choosing and generating parameters for pairing implementation on BN curves, Efficient Self-pairing on Ordinary Elliptic Curves, Pairing Lattices, Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field, Integer Variable χ–Based Ate Pairing, Finite Field Multiplication Combining AMNS and DFT Approach for Pairing Cryptography, Faster Pairings on Special Weierstrass Curves, Skew Frobenius Map and Efficient Scalar Multiplication for Pairing–Based Cryptography

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Weil pairing, and its efficient calculation
• A taxonomy of pairing-friendly elliptic curves
• Efficient pairing computation on supersingular abelian varieties
• The Eta Pairing Revisited
• Choosing the correct elliptic curve in the CM method
• Compact Group Signatures Without Random Oracles
• Pairing-Friendly Elliptic Curves of Prime Order
• Selected Areas in Cryptography
• Full-Domain Subgroup Hiding and Constant-Size Group Signatures
• Cryptography and Coding
• Advances in Cryptology - ASIACRYPT 2003