TY - GEN
T1 - Implementation and Evaluation of Ate Pairings on Elliptic Curves with Embedding Degree 10 Applied Type-II All-One Polynomial Extension Field of Degree 5
AU - Matsumura, Rikuya
AU - Takahashi, Yuto
AU - Nanjo, Yuki
AU - Kusaka, Takuya
AU - Nogami, Yasuyuki
N1 - Funding Information:
This research was supported by JSPS KAKENHI Grant Number JP19H05579.
Publisher Copyright:
© 2020 IEICE.
PY - 2020/7
Y1 - 2020/7
N2 - Pairing-based cryptography has received much attention as an encryption method for realizing advanced cryptography such as ID-based encryption and searchable encryption. In a pairing-friendly elliptic curve of embedding degree 10, calculation cost of multiplication and squaring on extension fields of degree 5 are related to efficiency of pairing. Therefore, it is necessary to select an efficient multiplication and squaring algorithms on the extension field of degree 5. To apply these algorithms, the authors implement a pairing on an elliptic curve of embedding degree 10 with type-II all-one polynomial extension field (AOPF) of degree of 5 and optimal extension field (OEF) of degree of 5. As a result, the computational complexity of pairing with the expanded AOPF of degree 5 are almost 7.4% efficient than that of the expanded OEF of degree 5.
AB - Pairing-based cryptography has received much attention as an encryption method for realizing advanced cryptography such as ID-based encryption and searchable encryption. In a pairing-friendly elliptic curve of embedding degree 10, calculation cost of multiplication and squaring on extension fields of degree 5 are related to efficiency of pairing. Therefore, it is necessary to select an efficient multiplication and squaring algorithms on the extension field of degree 5. To apply these algorithms, the authors implement a pairing on an elliptic curve of embedding degree 10 with type-II all-one polynomial extension field (AOPF) of degree of 5 and optimal extension field (OEF) of degree of 5. As a result, the computational complexity of pairing with the expanded AOPF of degree 5 are almost 7.4% efficient than that of the expanded OEF of degree 5.
KW - All-one polynomial extension field
KW - Embedding degree 10
KW - Optimal extension field
KW - Pairing-based cryptography
UR - http://www.scopus.com/inward/record.url?scp=85091445687&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85091445687&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:85091445687
T3 - ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications
SP - 336
EP - 341
BT - ITC-CSCC 2020 - 35th International Technical Conference on Circuits/Systems, Computers and Communications
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 35th International Technical Conference on Circuits/Systems, Computers and Communications, ITC-CSCC 2020
Y2 - 3 July 2020 through 6 July 2020
ER -