2014•Unpublished venueRequires access

Fast Elliptic scalar multiplication using lagged Fibonacci generator

Hui Li, Zhonghua Liu, Junkai Yi

Abstract

Scalar multiplication is the dominant and time consuming operation in Elliptic Curve Cryptosystem. A number of works bearing on improving the efficiency of scalar multiplication have been done during the past several years. In this paper, we attempt to present a new strategy by combining scalar multiplication with the pseudorandom number generator: lagged Fibonacci generator to accelerate the process of scalar multiplication. Experimental results identify the efficiency of the strategy.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Scalar multiplication, Elliptic curve point multiplication, Scalar (mathematics), Fibonacci number, Elliptic Curve Digital Signature Algorithm, Pseudorandom number generator, Arithmetic, Elliptic curve cryptography