Paper 2009/564

Optimal pairing revisited

Mingqiang Wang, Puwen Wei, Haifeng Zhang, and 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
Published elsewhere. Unknown where it was published
Contact author(s)
mqwang71 @ hotmail com
History
2009-11-23: received
Short URL
https://ia.cr/2009/564
License
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2009/564}},
      url = {https://eprint.iacr.org/2009/564}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.