Cryptology ePrint Archive: Report 2010/379

Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree

Sorina Ionica and Antoine Joux

Abstract: Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He points out that pairing implementation becomes thus faster on these curves than on their supersingular equivalent, originally recommended by Boneh and Franklin for Identity Based Encryption. We extend Scott's method to other classes of curves with small embedding degree and efficiently computable endomorphism.

Category / Keywords: elliptic curves, pairings, isogenies

Date: received 5 Jul 2010, last revised 13 Sep 2010

Contact author: sorina ionica at m4x org

Available format(s): PDF | BibTeX Citation

Version: 20100913:132318 (All versions of this report)

Short URL:

Discussion forum: Show discussion | Start new discussion

[ Cryptology ePrint archive ]