Visible to the public Improvement of Final Exponentiation for a Pairing on FK12 Curve and its Implementation

TitleImprovement of Final Exponentiation for a Pairing on FK12 Curve and its Implementation
Publication TypeConference Paper
Year of Publication2022
AuthorsIkesaka, Kazuma, Nanjo, Yuki, Kodera, Yuta, Kusaka, Takuya, Nogami, Yasuyuki
Conference Name2022 37th International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC)
KeywordsComputers, cryptography, elliptic curve, Elliptic curves, exponentiation, final exponentiation, Galois fields, human factors, Identity-based encryption, pairing-based cryptography, Protocols, pubcrawl, resilience, Resiliency, Scalability
AbstractPairings on elliptic curves are used for innovative protocols such as ID-based encryption and zk-SNARKs. To make the pairings secure, it is important to consider the STNFS which is the special number field sieve algorithm for discrete logarithms in the finite field. The Fotiadis-Konstantinou curve with embedding degree 12(FK12), is known as one of the STNFS secure curves. To an efficient pairing on the FK12 curve, there are several previous works that focus on final exponentiation. The one is based on lattice-based method to decompose the hard part of final exponentiation and addition chain. However, there is a possibility to construct a more efficient calculation algorithm by using the relations appeared in the decomposition calculation algorithm than that of the previous work. In this manuscript, the authors propose a relation of the decomposition and verify the effectiveness of the proposed method from the execution time.
DOI10.1109/ITC-CSCC55581.2022.9894996
Citation Keyikesaka_improvement_2022