Pairing Computation on Twisted Edwards Form Elliptic Curves

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

Palash Sarkar, M. Prem Laxman Das

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 curve; pairings; supersingular curve; Edwards form; Miller function

Mathematics Subject Classification ID

11T71: Algebraic coding theory; cryptography (number-theoretic aspects)

94A60: Cryptography

11Y16: Number-theoretic algorithms; complexity

Related Items

Huff’s Model for Elliptic Curves, Further refinements of Miller's algorithm on Edwards curves, The pairing computation on Edwards curves, Faster computation of the Tate pairing, On Edwards curves and ZVP-attacks, Pairing Computation on Edwards Curves with High-Degree Twists

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