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 the 192-bit security level. Implementations indicate that the computation of the final exponentiation is 8.74% faster than the previously fastest result.
Shi Ping CAI
Sun Yat-sen University
Zhi HU
Central South University
Chang An ZHAO
Sun Yat-sen University,the Guangdong Key Laboratory of Information Security
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shi Ping CAI, Zhi HU, Chang An ZHAO, "Faster Final Exponentiation on the KSS18 Curve" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 8, pp. 1162-1164, August 2022, doi: 10.1587/transfun.2021EAL2086.
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 the 192-bit security level. Implementations indicate that the computation of the final exponentiation is 8.74% faster than the previously fastest result.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021EAL2086/_p
Copy
@ARTICLE{e105-a_8_1162,
author={Shi Ping CAI, Zhi HU, Chang An ZHAO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Faster Final Exponentiation on the KSS18 Curve},
year={2022},
volume={E105-A},
number={8},
pages={1162-1164},
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 the 192-bit security level. Implementations indicate that the computation of the final exponentiation is 8.74% faster than the previously fastest result.},
keywords={},
doi={10.1587/transfun.2021EAL2086},
ISSN={1745-1337},
month={August},}
Copy
TY - JOUR
TI - Faster Final Exponentiation on the KSS18 Curve
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1162
EP - 1164
AU - Shi Ping CAI
AU - Zhi HU
AU - Chang An ZHAO
PY - 2022
DO - 10.1587/transfun.2021EAL2086
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2022
AB - 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 the 192-bit security level. Implementations indicate that the computation of the final exponentiation is 8.74% faster than the previously fastest result.
ER -