On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves

DOI10.1007/978-3-642-03298-1_6zbMath1248.94093OpenAlexW1553871775MaRDI QIDQ3392904

No author found.

Publication date: 18 August 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-03298-1_6

zbMATH Keywords

Tate pairingaddition chainsaddition sequences

Mathematics Subject Classification ID

Cryptography (94A60) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (16)

Faster Hashing to ${\mathbb G}_2$ ⋮ Memory-saving computation of the pairing final exponentiation on BN curves ⋮ CRT-Based Outsourcing Algorithms for Modular Exponentiations ⋮ Subgroup Security in Pairing-Based Cryptography ⋮ Failure of the Point Blinding Countermeasure Against Fault Attack in Pairing-Based Cryptography ⋮ A survey of fault attacks in pairing based cryptography ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Unnamed Item ⋮ An Improvement of Optimal Ate Pairing on KSS Curve with Pseudo 12-Sparse Multiplication ⋮ Choosing and generating parameters for pairing implementation on BN curves ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Low-cost addition-subtraction sequences for the final exponentiation in pairings ⋮ Improving the computation of the optimal ate pairing for a high security level ⋮ Parallelizing the Weil and Tate Pairings ⋮ Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings ⋮ Adequate Elliptic Curves for Computing the Product of n Pairings

Cites Work

• A taxonomy of pairing-friendly elliptic curves
• Elliptic curves suitable for pairing based cryptography
• On Compressible Pairings and Their Computation
• Constructing Brezing-Weng Pairing-Friendly Elliptic Curves Using Elements in the Cyclotomic Field
• Integer Variable χ–Based Ate Pairing
• Computing Sequences with Addition Chains
• On vectorial addition chains
• Advances in Cryptology – CRYPTO 2004
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Pairing-Friendly Elliptic Curves of Prime Order
• Implementing Cryptographic Pairings over Barreto-Naehrig Curves
• Advances in Elliptic Curve Cryptography
• Selected Areas in Cryptography
• Algorithmic Number Theory
• Algorithmic Number Theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the Final Exponentiation for Calculating Pairings on Ordinary Elliptic Curves