Paper 2021/1309

Faster Final Exponentiation on the KSS18 Curve

Shiping Cai, Zhi Hu, and Chang-An Zhao

Abstract

The final exponentiation affects the efficiency of pairing computations especially on pairing-friendly curves with high embedding degree. We propose an efficient method for computing the hard part of the final exponentiation on the KSS18 curve at 192-bit security level. Implementations indicate that the computation of the final exponentiation can be 8.74% faster than the previously fastest result.

Metadata
Available format(s)
PDF
Category
Implementation
Publication info
Preprint. Minor revision.
Keywords
Final exponentiationpairingsKSS curveshigh security levels
Contact author(s)
zhaochan3 @ mail sysu edu cn
History
2021-09-28: received
Short URL
https://ia.cr/2021/1309
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2021/1309,
      author = {Shiping Cai and Zhi Hu and Chang-An Zhao},
      title = {Faster Final Exponentiation on the KSS18 Curve},
      howpublished = {Cryptology ePrint Archive, Paper 2021/1309},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/1309}},
      url = {https://eprint.iacr.org/2021/1309}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.