Welcome to the resource topic for 2016/1187
Title:
Computing Optimal Ate Pairings on Elliptic Curves with Embedding Degree 9,15 and 27
Authors: Emmanuel Fouotsa, Nadia El Mrabet, 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 k=9, 15 \mbox{ and } 27 which have twists of order three. Mainly, we provide a detailed arithmetic and cost estimation of operations in the tower extensions field of the corresponding extension fields. A good selection of parameters enables us to improve the theoretical cost for the Miller step and the final exponentiation using the lattice-based method comparatively to the previous few works that exist in these cases. In particular for k=15 and k=27 we obtained an improvement, in terms of operations in the base field, of up to 25\% and 29\% respectively in the computation of the final exponentiation. Also, we obtained that elliptic curves with embedding degree k=15 present faster results than BN$12$ curves at the 128-bit security levels. We provided a MAGMA implementation in each case to ensure the correctness of the formulas used in this work.
ePrint: https://eprint.iacr.org/2016/1187
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 .