Paper 2016/1187
Computing Optimal Ate Pairings on Elliptic Curves with Embedding Degree and
Emmanuel Fouotsa, Nadia El Mrabet, and Aminatou Pecha
Abstract
Much attention has been given to efficient computation of pairings on elliptic curves with even embedding degree since the advent of pairing-based cryptography. The existing few works in the case of odd embedding degrees require some improvements.
This paper considers the computation of optimal ate pairings on elliptic curves of embedding degrees
Note: Corrections of minor errors
Metadata
- Available format(s)
-
PDF
- Publication info
- Preprint. MINOR revision.
- Keywords
- Elliptic CurvesOptimal PairingsMiller's algorithmExtension fields arithmeticFinal exponentiation
- Contact author(s)
- emmanuelfouotsa @ yahoo fr
- History
- 2018-11-15: last of 2 revisions
- 2017-01-01: received
- See all versions
- Short URL
- https://ia.cr/2016/1187
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2016/1187, author = {Emmanuel Fouotsa and Nadia El Mrabet and Aminatou Pecha}, title = {Computing Optimal Ate Pairings on Elliptic Curves with Embedding Degree $9,15$ and $27$}, howpublished = {Cryptology {ePrint} Archive, Paper 2016/1187}, year = {2016}, url = {https://eprint.iacr.org/2016/1187} }