Pairing Computation on Twisted Edwards Form Elliptic Curves

DOI10.1007/978-3-540-85538-5_14zbMath1186.94433OpenAlexW2135616576MaRDI QIDQ3600505

M. Prem Laxman Das, Palash Sarkar

Publication date: 10 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85538-5_14

zbMATH Keywords

elliptic curvepairingssupersingular curveEdwards formMiller function

Mathematics Subject Classification ID

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

Related Items (8)

Further refinements of Miller's algorithm on Edwards curves ⋮ Pairing Computation on Edwards Curves with High-Degree Twists ⋮ Faster computation of the Tate pairing ⋮ On Edwards curves and ZVP-attacks ⋮ Parallelizing pairings on Hessian elliptic curves ⋮ The pairing computation on Edwards curves ⋮ Connecting Legendre with Kummer and Edwards ⋮ Huff’s Model for Elliptic Curves

Uses Software

• Mathematica

Cites Work

• Unnamed Item
• Unnamed Item
• A one round protocol for tripartite Diffie-Hellman
• Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
• The Weil pairing, and its efficient calculation
• A taxonomy of pairing-friendly elliptic curves
• A Remark Concerning m-Divisibility and the Discrete Logarithm in the Divisor Class Group of Curves
• Identity-Based Encryption from the Weil Pairing
• Inverted Edwards Coordinates
• 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
• Cryptography and Coding

This page was built for publication: Pairing Computation on Twisted Edwards Form Elliptic Curves