Title: Fast elliptic curve algorithm using deformed Fibonacci-type series

Authors: Shuanggen Liu; Guanglu Qi; Xu An Wang

Addresses: School of Telecommunication and Information Engineering, Xi'an University of Post Telecommunications, Xi'an 710121, China ' Xi'an University of Post Telecommunications, Xi'an 710121, China ' Electronics Department, Engineering University of the Armed Police Force, Xi'an 710086, China

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.

Keywords: elliptic curve cryptosystem; scalar multiplication; Fibonacci sequence; addition chain.

DOI: 10.1504/IJES.2018.090563

International Journal of Embedded Systems, 2018 Vol.10 No.2, pp.104 - 112

Received: 16 Jan 2016
Accepted: 13 Jan 2017
Published online: 22 Mar 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article