Cryptology ePrint Archive: Report 2021/1309

Faster Final Exponentiation on the KSS18 Curve

Shiping Cai and 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.

Category / Keywords: implementation / Final exponentiation, pairings, KSS curves, high security levels

Date: received 28 Sep 2021

Contact author: zhaochan3 at mail sysu edu cn

Available format(s): PDF | BibTeX Citation

Version: 20210928:183131 (All versions of this report)

Short URL: ia.cr/2021/1309


[ Cryptology ePrint archive ]