, Laboratory of Analysis, Probability and Fractals, University of Monastir, Tunisia
Walid Haddaji, Science and technology for defense lab LR19DN01, Center for military research, military academy, Tunis, Tunisia
Pairing-based cryptography relies heavily on the efficiency of bilinear pairings, the computation of which is dominated by the final exponentiation step. This paper describes an efficient cubing operation in the cyclotomic subgroup of $\mathbb{F}_{q^6}$ for $q\equiv1\mod{6}$. As an application, we use existing results for computing Frobenius maps to optimize the cost of the optimal Ate pairing final exponentiation over the SG54 curve. Furthermore, we introduce a novel decomposition for the hard part of the final exponentiation for this curve. Additionally, we apply established methods for cyclotomic cubing to accelerate the final exponentiation for the BLS15 and BLS27 curves. Compared to previous works, our approach achieves efficiency gains of $24\%$ for SG54 and $22\%$ for the BLS15 and BLS27 curves.
BibTeX
@misc{cryptoeprint:2026/885,
author = {Leila Ben Abdelghani and Walid Haddaji},
title = {Optimized Final Exponentiation for Optimal Ate Pairings Using Cyclotomic Cubing},
howpublished = {Cryptology {ePrint} Archive, Paper 2026/885},
year = {2026},
url = {https://eprint.iacr.org/2026/885}
}
此内容由惯性聚合(RSS阅读器)自动聚合整理，仅供阅读参考。 原文来自 — 版权归原作者所有。