CryptoDB
Pairing computation on curves with efficiently computable endomorphism and small embedding degree
| Authors: | |
|---|---|
| Download: | |
| Abstract: | Scott uses an efficiently computable isomorphism in order to optimize pairing computation on a particular class of curves with embedding degree 2. He pointed 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. In particular, we optimize pairing computation on a class of curves with embedding degree 4 and discriminant 1, which are interesting for pairing based cryptography because they have a very efficient arithmetic. |
BibTeX
@misc{eprint-2010-23280,
title={Pairing computation on curves with efficiently computable endomorphism and small embedding degree},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / elliptic curves, pairings, isogenies},
url={http://eprint.iacr.org/2010/379},
note={ sorina.ionica@m4x.org 14795 received 5 Jul 2010},
author={Sorina Ionica and Antoine Joux},
year=2010
}