Paper 2007/457

Comparing Implementation Efficiency of Ordinary and Squared Pairings

Christine Abegail Antonio, Tanaka Satoru, and Ken Nakamula

Abstract

In this paper, we will implement a standard probabilistic method of computing bilinear pairings. We will compare its performance to a deterministic algorithm introduced in [5] to compute the squared Tate/Weil pairings which are claimed to be 20 percent faster than the standard method. All pairings will be evaluated over pairing-friendly ordinary elliptic curves of embedding degrees 8 and 10 and a supersingular curve of embedding degree 6. For these curves, we can make the algorithm to compute both the ordinary Weil and Tate pairings deterministic and optimizations to improve the algorithms are applied. We will show that the evaluation of squared Weil pairing is, indeed, faster than the ordinary Weil pairing even with optimizations. However, evaluation of the squared Tate pairing is not faster than the ordinary Tate pairing over the curves that we used when optimizations are applied.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Published elsewhere. Unknown where it was published
Keywords
bilinear pairingssquared WeilTate pairingscryptographypairing-friendly curves
Contact author(s)
abby ballesteros @ gmail com
History
2007-12-10: received
Short URL
https://ia.cr/2007/457
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2007/457,
      author = {Christine Abegail Antonio and Tanaka Satoru and Ken Nakamula},
      title = {Comparing Implementation Efficiency of Ordinary and Squared Pairings},
      howpublished = {Cryptology ePrint Archive, Paper 2007/457},
      year = {2007},
      note = {\url{https://eprint.iacr.org/2007/457}},
      url = {https://eprint.iacr.org/2007/457}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.