Sciweavers

Share
PAIRING
2010
Springer

Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree

8 years 9 months ago
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
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.
Sorina Ionica, Antoine Joux
Added 14 Feb 2011
Updated 14 Feb 2011
Type Journal
Year 2010
Where PAIRING
Authors Sorina Ionica, Antoine Joux
Comments (0)
books