Another Approach to Pairing Computation in Edwards Coordinates.

Bibliographic Details
Title: Another Approach to Pairing Computation in Edwards Coordinates.
Authors: Ionica, Sorina, Joux, Antoine
Source: Progress in Cryptology - INDOCRYPT 2008; 2008, p400-413, 14p
Abstract: The recent introduction of Edwards curves has significantly reduced the cost of addition on elliptic curves. This paper presents new explicit formulae for pairing implementation in Edwards coordinates. We prove our method gives performances similar to those of Miller΄s algorithm in Jacobian coordinates and is thus of cryptographic interest when one chooses Edwards curve implementations of protocols in elliptic curve cryptography. The method is faster than the recent proposal of Das and Sarkar for computing pairings on supersingular curves using Edwards coordinates. [ABSTRACT FROM AUTHOR]
Copyright of Progress in Cryptology - INDOCRYPT 2008 is the property of Springer Nature / Books and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
DOI: 10.1007/978-3-540-89754-5_31
Database: Complementary Index