Optimal pairing revisited

Mingqiang  Wang; Puwen Wei; Haifeng Zhang; Yuliang Zheng

Paper 2009/564 Original: eprint.iacr.org/2009/564 ↗

Optimal pairing revisited

Mingqiang Wang

Puwen Wei

Haifeng Zhang

Yuliang Zheng

Abstract

Vercauteren introduced a notion of optimal pairings. Up to know the only known optimal pairing is the optimal Ate pairing. In this paper, we give some properties of optimal pairing and provide an algorithm for finding an optimal pairing if there exists one which is defined on the given elliptic curve. Applying the cyclotomic polynomial, we construct some new optimal pairings and provide a construction method of pairing-friendly elliptic curves on which the optimal pairing can be defined. Our algorithm is explicit and works for arbitrary embedding degree $k$ and large prime subgroup orders $r$.

Metadata

Available format(s): PDF
Category: Implementation
Publication info: Preprint.
History: 2009-11-23: last updated; 2009-11-23: published
Short URL: https://ia.cr/2009/564
License: https://creativecommons.org/licenses/by/4.0/

BibTeX

@misc{cryptoeprint:2009/564,
      author = {Mingqiang  Wang and Puwen Wei and Haifeng Zhang and Yuliang Zheng},
      title = {Optimal pairing revisited},
      howpublished = {Cryptology {ePrint} Archive, Paper 2009/564},
      year = {2009},
      url = {https://eprint.iacr.org/2009/564}
}