TY - GEN
T1 - Improvement of Miller Loop for a Pairing on FK12 Curve and its Implementation
AU - Ikesaka, Kazuma
AU - Nanjo, Yuki
AU - Kodera, Yuuta
AU - Kusaka, Takuya
AU - Nogami, Yasuyuki
N1 - Funding Information:
VI. ACKNOWLEDGEMENT This research was supported by JSPS KAKENHI Grant Number 19H05579.
Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Pairing is carried out by two steps, Miller loop and final exponentiation. In this manuscript, the authors propose an efficient Miller loop for a pairing on the FK12 curve. A Hamming weight and bit-length of loop parameter have a great effect on the computational cost of Miller loop. Optimal-ate pairing is used as the most efficient pairing on the FK12 curve currently. The loop parameter of optimal-ate pairing is 6z+2 where z is the integer to make the FK12 curve parameter. Our method uses z which has a shorter bit-length than the previous optimal-ate pairing as the loop parameter. Usually, z has a low Hamming weight to make final exponentiation efficient. Therefore, the loop parameter in our method has a lower Hamming weight than the loop parameter of the previous one in many cases. The authors evaluate our method by the number of multiplications and execution time. As a result, the proposed algorithm leads to the 3.71% reduction in the number of multiplications and the 3.38% reduction in the execution time.
AB - Pairing is carried out by two steps, Miller loop and final exponentiation. In this manuscript, the authors propose an efficient Miller loop for a pairing on the FK12 curve. A Hamming weight and bit-length of loop parameter have a great effect on the computational cost of Miller loop. Optimal-ate pairing is used as the most efficient pairing on the FK12 curve currently. The loop parameter of optimal-ate pairing is 6z+2 where z is the integer to make the FK12 curve parameter. Our method uses z which has a shorter bit-length than the previous optimal-ate pairing as the loop parameter. Usually, z has a low Hamming weight to make final exponentiation efficient. Therefore, the loop parameter in our method has a lower Hamming weight than the loop parameter of the previous one in many cases. The authors evaluate our method by the number of multiplications and execution time. As a result, the proposed algorithm leads to the 3.71% reduction in the number of multiplications and the 3.38% reduction in the execution time.
KW - Miller loop
KW - pairing based cryptography
KW - STNFS
UR - http://www.scopus.com/inward/record.url?scp=85148596719&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85148596719&partnerID=8YFLogxK
U2 - 10.1109/CANDAR57322.2022.00021
DO - 10.1109/CANDAR57322.2022.00021
M3 - Conference contribution
AN - SCOPUS:85148596719
T3 - Proceedings - 2022 10th International Symposium on Computing and Networking, CANDAR 2022
SP - 104
EP - 109
BT - Proceedings - 2022 10th International Symposium on Computing and Networking, CANDAR 2022
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th International Symposium on Computing and Networking, CANDAR 2022
Y2 - 21 November 2022 through 22 November 2022
ER -