TY - JOUR
T1 - An improvement of scalar multiplication by skew frobenius map with multi-scalar multiplication for KSS curve
AU - Khandaker, Md Al Amin
AU - Nogami, Yasuyuki
N1 - Funding Information:
This work was partially supported by the Strategic Information and Communications R&D Promotion Programme (SCOPE) of Ministry of Internal Affairs and Communications, Japan.
Publisher Copyright:
Copyright © 2017 The Institute of Electronics, Information and Communication Engineers.
Copyright:
Copyright 2017 Elsevier B.V., All rights reserved.
PY - 2017/9
Y1 - 2017/9
N2 - Scalar multiplication over higher degree rational point groups is often regarded as the bottleneck for faster pairing based cryp-tography. This paper has presented a skew Frobenius mapping technique in the sub-field isomorphic sextic twisted curve of Kachisa-Schaefer-Scott (KSS) pairing friendly curve of embedding degree 18 in the context of Ate based pairing. Utilizing the skew Frobenius map along with multi-scalar multiplication procedure, an efficient scalar multiplication method for KSS curve is proposed in the paper. In addition to the theoretic proposal, this paper has also presented a comparative simulation of the proposed approach with plain binary method, sliding window method and non-adjacent form (NAF) for scalar multiplication. The simulation shows that the proposed method is about 60 times faster than plain implementation of other compared methods.
AB - Scalar multiplication over higher degree rational point groups is often regarded as the bottleneck for faster pairing based cryp-tography. This paper has presented a skew Frobenius mapping technique in the sub-field isomorphic sextic twisted curve of Kachisa-Schaefer-Scott (KSS) pairing friendly curve of embedding degree 18 in the context of Ate based pairing. Utilizing the skew Frobenius map along with multi-scalar multiplication procedure, an efficient scalar multiplication method for KSS curve is proposed in the paper. In addition to the theoretic proposal, this paper has also presented a comparative simulation of the proposed approach with plain binary method, sliding window method and non-adjacent form (NAF) for scalar multiplication. The simulation shows that the proposed method is about 60 times faster than plain implementation of other compared methods.
KW - KSS curve
KW - Scalar multiplication
KW - Skew Frobenius mapping
UR - http://www.scopus.com/inward/record.url?scp=85028777442&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028777442&partnerID=8YFLogxK
U2 - 10.1587/transfun.E100.A.1838
DO - 10.1587/transfun.E100.A.1838
M3 - Article
AN - SCOPUS:85028777442
VL - E100A
SP - 1838
EP - 1845
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
SN - 0916-8508
IS - 9
ER -