Paper 2008/292 Original: eprint.iacr.org/2008/292 ↗
Another approach to pairing computation in Edwards coordinates
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 2009-02-13: last updated
- 2008-07-03: published
- Short URL
- https://ia.cr/2008/292
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2008/292,
author = {Sorina Ionica and Antoine Joux},
title = {Another approach to pairing computation in Edwards coordinates},
howpublished = {Cryptology {ePrint} Archive, Paper 2008/292},
year = {2008},
url = {https://eprint.iacr.org/2008/292}
}