Welcome to the resource topic for 2010/379
Title:
Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree
Authors: Sorina Ionica, 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.
ePrint: https://eprint.iacr.org/2010/379
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .