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

@article{Lin2007ComputingTA,
  title={Computing the Ate Pairing on Elliptic Curves with Embedding Degree k = 9},
  author={Xibin Lin and Changan Zhao and Fangguo Zhang and Yanming Wang},
  journal={IACR Cryptology ePrint Archive},
  year={2007},
  volume={2007},
  pages={434}
}
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… CONTINUE READING