Novel Method for Elliptic Curve Multi-Scalar Multiplication
نویسندگان
چکیده
The major building block of most elliptic curve cryptosystems are computation of multi-scalar multiplication. This paper proposes a novel algorithm for simultaneous multi-scalar multiplication, that is by employing addition chains. The previously known methods utilizes double-and-add algorithm with binary representations. In order to accomplish our purpose, an efficient empirical method for finding addition chains for multi-exponents has been proposed. Keywords—elliptic curve cryptosystems, multi-scalar multiplication, addition chains, Fibonacci sequence.
منابع مشابه
A Novel Method for Elliptic Curve Multi-Scalar Multiplication
The major building block of most elliptic curve cryptosystems are computation of multi-scalar multiplication. This paper proposes a novel algorithm for simultaneous multi-scalar multiplication, that is by employing addition chains. The previously known methods utilizes double-and-add algorithm with binary representations. In order to accomplish our purpose, an efficient empirical method for fin...
متن کاملA Novel and Efficient Hardware Implementation of Scalar Point Multiplier
A new and highly efficient architecture for elliptic curve scalar point multiplication is presented. To achieve the maximum architectural and timing improvements we have reorganized and reordered the critical path of the Lopez-Dahab scalar point multiplication architecture such that logic structures are implemented in parallel and operations in the critical path are diverted to noncritical path...
متن کاملElliptic Curve Scalar Point Multiplication Algorithm Using Radix-4 Booth’s Algorithm
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication, which is performed in the topmost level of GF multiplication and GF division, has been the double-and-add algorithm, which is being recently challenged by NAF (Non-Adjacent Format) algorithm. In this paper, we propose a more e...
متن کاملA Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems
The main back-bone operation in elliptic curve cryptosystems is scalar point multiplication. The most frequently used method implementing the scalar point multiplication which is performed in the top level of GF (Galois Field) multiplication and GF division, has been the double-andadd algorithm, which is being recently challenged by NAF (Non-Adjacent Format) algorithm. In this paper, we propose...
متن کاملFast Scalar Multiplication in ECC using The Multi base Number System
As a generalization of double base chains, multibase number system is very suitable for efficient computation of scalar multiplication of a point of elliptic curve because of shorter representation length and hamming weight. In this paper combined with the given formulas for computing the 7Fold of an elliptic curve point P an efficient scalar multiplication algorithm of elliptic curve is propos...
متن کامل