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.
Category / Keywords: elliptic curve, Edwards curves, pairings Date: received 28 Jun 2008, last revised 13 Feb 2009 Contact author: sorina ionica at m4x org Available format(s): PDF | BibTeX Citation Note: Thorough revision, taking into account reviewer feedback. This is an extended version of Indocrypt 2008 paper. Version: 20090213:094624 (All versions of this report) Short URL: ia.cr/2008/292 Discussion forum: Show discussion | Start new discussion