Fast elliptic curve algorithm using deformed Fibonacci-type series
by Shuanggen Liu; Guanglu Qi; Xu An Wang
International Journal of Embedded Systems (IJES), Vol. 10, No. 2, 2018

Abstract: The efficient and secure scalar multiplication can be constructed by combining the addition chain and elliptic curve. In this paper, we propose an explicit algorithm which is a kind of 'double-addition' addition chain based on the Fibonacci-type sequence. The 'double-addition' sequence of arbitrary integer k is calculated by using Fibonacci and golden ratio addition chain method. In addition, each cycle of this method is fixed to perform double point and a point add operations based on the 'double-addition' of the elliptic curve scalar multiplication algorithm, so as to be able to resist the simple power attack. At the same time, the length of the chain is greatly shortened by using the double point operation compared with the chain of the Fibonacci. Experimental results showed that the average chain length has attained 38% to 55% reduction compared to other doubling-free addition chain methods.

Online publication date: Thu, 22-Mar-2018

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Embedded Systems (IJES):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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