Paper 2008/212

Reducing the Complexity of the Weil Pairing Computation

Chang-An Zhao, Fangguo Zhang, and Dongqing Xie

Abstract

In this paper, we present some new variants based on the Weil pairing for efficient pairing computations. The new pairing variants have the short Miller iteration loop and simple final exponentiation. We then show that computing the proposed pairings is more efficient than computing the Weil pairing. Experimental results for these pairings are also given.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Weil pairingate pairingelliptic curvespairing based cryptography
Contact author(s)
changanzhao @ gmail com
History
2010-06-18: revised
2008-05-21: received
See all versions
Short URL
https://ia.cr/2008/212
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2008/212,
      author = {Chang-An Zhao and Fangguo Zhang and Dongqing Xie},
      title = {Reducing the Complexity of the Weil Pairing Computation},
      howpublished = {Cryptology ePrint Archive, Paper 2008/212},
      year = {2008},
      note = {\url{https://eprint.iacr.org/2008/212}},
      url = {https://eprint.iacr.org/2008/212}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.