Paper 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.
Metadata
- Available format(s)
-
PDF
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- elliptic curvespairingsisogenies
- Contact author(s)
- sorina ionica @ m4x org
- History
- 2010-09-13: last of 2 revisions
- 2010-07-07: received
- See all versions
- Short URL
- https://ia.cr/2010/379
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2010/379,
author = {Sorina Ionica and Antoine Joux},
title = {Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree},
howpublished = {Cryptology {ePrint} Archive, Paper 2010/379},
year = {2010},
url = {https://eprint.iacr.org/2010/379}
}
