Another Approach to Pairing Computation in Edwards Coordinates
From MaRDI portal
Publication:5504639
DOI10.1007/978-3-540-89754-5_31zbMath1203.94104OpenAlexW1810472045MaRDI QIDQ5504639
Publication date: 22 January 2009
Published in: Progress in Cryptology - INDOCRYPT 2008 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-89754-5_31
Related Items (11)
Further refinements of Miller's algorithm on Edwards curves ⋮ Pairing Computation on Edwards Curves with High-Degree Twists ⋮ Faster computation of the Tate pairing ⋮ The pairing computation on Edwards curves ⋮ Huff’s Model for Elliptic Curves ⋮ An Analysis of Affine Coordinates for Pairing Computation ⋮ Pairing-based algorithms for Jacobians of genus 2 curves with maximal endomorphism ring ⋮ Deterministic Encoding into Twisted Edwards Curves ⋮ What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol? ⋮ Isogeny graphs with maximal real multiplication ⋮ Another Approach to Pairing Computation in Edwards Coordinates
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A one round protocol for tripartite Diffie-Hellman
- The Weil pairing, and its efficient calculation
- Signed bits and fast exponentiation
- A taxonomy of pairing-friendly elliptic curves
- Elliptic curves suitable for pairing based cryptography
- Twisted Edwards Curves
- The Eta Pairing Revisited
- Faster Addition and Doubling on Elliptic Curves
- A normal form for elliptic curves
- Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
- Advances in Elliptic Curve Cryptography
- Another Approach to Pairing Computation in Edwards Coordinates
- Cryptography and Coding
- Algorithmic Number Theory
This page was built for publication: Another Approach to Pairing Computation in Edwards Coordinates