Fast elliptic curve scalar multiplication for resisting against SPA Online publication date: Thu, 25-Oct-2018
by Shuanggen Liu; Huatong Yao; Xu An Wang
International Journal of Computational Science and Engineering (IJCSE), Vol. 17, No. 3, 2018
Abstract: This paper analyses the computation of symbolic ternary form (STF) elliptic curve scalar multiplication algorithm and binary scalar multiplication algorithm. Compared with binary scalar multiplication algorithm, the efficiency of STF scalar multiplication algorithm is increased by 5.9% on average and has a corresponding advantage. For this reason, we improve the structure of STF scalar multiplication algorithm and make the performance more 'smooth' by constructing indistinguishable operation between points addition (A) and triple point (T) and thus to resist against the simple power analysis attacks. At the same time, we propose highest-weight symbolic ternary form (HSTF), which makes a scalar k transform into the highest-weight form. Thus, every cycle has a fixed pattern to resist against SPA attack. With respect to binary scalar multiplication algorithm with anti-SPA, the average efficiency in enhanced by 17.7%.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computational Science and Engineering (IJCSE):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook