International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Computing the Ate Pairing on Elliptic Curves with Embedding Degree $k=9$

Authors:
Xibin Lin
Chang-An Zhao
Fangguo Zhang
Yanming Wang
Download:
URL: http://eprint.iacr.org/2007/434
Search ePrint
Search Google
Abstract: For AES 128 security level there are several natural choices for pairing-friendly elliptic curves. In particular, as we will explain, one might choose curves with $k=9$ or curves with $k=12$. The case $k=9$ has not been studied in the literature, and so it is not clear how efficiently pairings can be computed in that case. In this paper, we present efficient methods for the $k=9$ case, including generation of elliptic curves with the shorter Miller loop, the denominator elimination and speed up of the final exponentiation. Then we compare the performance of these choices. From the analysis, we conclude that for pairing-based cryptography at the AES 128 security level, the Barreto-Naehrig curves are the most efficient choice, and the performance of the case $k=9$ is comparable to the Barreto-Naehrig curves.
BibTeX
@misc{eprint-2007-13714,
  title={Computing the Ate Pairing on Elliptic Curves with Embedding Degree $k=9$},
  booktitle={IACR Eprint archive},
  keywords={Ate pairing, Denominator elimination, Final exponentiation},
  url={http://eprint.iacr.org/2007/434},
  note={ linxibin@mail2.sysu.edu.cn 13841 received 22 Nov 2007, last revised 24 Nov 2007},
  author={Xibin Lin and Chang-An Zhao and Fangguo Zhang and Yanming Wang},
  year=2007
}