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. © 2010 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Ionica, S., & Joux, A. (2010). Pairing computation on elliptic curves with efficiently computable endomorphism and small embedding degree. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6487 LNCS, pp. 435–449). https://doi.org/10.1007/978-3-642-17455-1_27
Mendeley helps you to discover research relevant for your work.