Another Approach to Pairing Computation in Edwards Coordinates

DOI10.1007/978-3-540-89754-5_31MaRDI QIDQ5504639zbMATH OpenOpenAlexFDO

Authors Sorina Ionica, Antoine Joux

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

zbMATH Keywords

Miller's algorithmTate pairingEdwards coordinates

Mathematics Subject Classification ID

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

Recommendations

• Pairing Computation on Twisted Edwards Form Elliptic Curves
• Faster computation of the Tate pairing
• The pairing computation on binary Edwards curves
• Faster Addition and Doubling on Elliptic Curves
• Refinement of Miller's algorithm over Edwards curves

Cites work

• scientific article; zbMATH DE number 3937328 (Why is no real title available?)
• scientific article; zbMATH DE number 3572315 (Why is no real title available?)
• scientific article; zbMATH DE number 2081084 (Why is no real title available?)
• scientific article; zbMATH DE number 1842494 (Why is no real title available?)
• A normal form for elliptic curves
• A one round protocol for tripartite Diffie-Hellman
• A taxonomy of pairing-friendly elliptic curves
• Advances in Elliptic Curve Cryptography
• Algorithmic Number Theory
• Another Approach to Pairing Computation in Edwards Coordinates
• Cryptography and Coding
• Efficient Computation of Tate Pairing in Projective Coordinate over General Characteristic Fields
• Elliptic curves suitable for pairing based cryptography
• Faster Addition and Doubling on Elliptic Curves
• Signed bits and fast exponentiation
• The Eta Pairing Revisited
• The Weil pairing, and its efficient calculation
• Twisted Edwards Curves

Cited in

(16)

• Computing pairings using x-coordinates only
• Pairing Computation on Twisted Edwards Form Elliptic Curves
• What about Vulnerability to a Fault Attack of the Miller’s Algorithm During an Identity Based Protocol?
• The pairing computation on Edwards curves
• Pairing-based algorithms for Jacobians of genus 2 curves with maximal endomorphism ring
• Deterministic encoding into twisted Edwards curves
• Isogeny graphs with maximal real multiplication
• Further refinements of Miller's algorithm on Edwards curves
• The pairing computation on binary Edwards curves
• Another Approach to Pairing Computation in Edwards Coordinates
• Huff's model for elliptic curves
• An analysis of affine coordinates for pairing computation
• Faster computation of the Tate pairing
• Pairing computation on Edwards curves with high-degree twists
• Refinement of Miller's algorithm over Edwards curves
• Application of scalar multiplication of Edwards curves to pairing-based cryptography

Describes a project that uses

Uses Software

• EFD

This page was built for publication: Another Approach to Pairing Computation in Edwards Coordinates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504639)