Computer and Modernization

Previous Articles     Next Articles

Multi-scalar Multiplication Algorithm for Elliptic Curve Based on MBNS and Sliding Window

  

  1. (1. Guangling College, Yangzhou University, Yangzhou 225000, China;
    2. College of Information Engineering, Yangzhou University, Yangzhou 225000, China)
  • Received:2018-05-11 Online:2019-01-30 Published:2019-01-30

Abstract: Scalar multiplication heavily determines the overall implementation efficiency of Elliptic Curve Cryptography(ECC), some elliptic curve cryptosystems of public keys require multi-scalar multiplication. Multi-base number system is very suitable for efficient computation of scalar multiplications of elliptic curves because of shorter representation length and less Hamming weight. In order to improve the efficiency of ECC, this paper proposes an efficient multi-scalar multiplication based on the existing scalar multiplication algorithm in binary fields and prime fields. This new algorithm is a combination of sliding window method and multi-base scalar multiplication algorithm. The experimental results show that the new algorithm costs less compared with Shamir’s trick and interleaving with NAF’s method. The new approach can effectively improve the efficiency of scalar multiplication algorithm, so that the scalar multiplication is more efficient. Compared to other algorithms, the new approach is improved about 7.9%~20.6%.

Key words: Elliptic Curve Cryptography(ECC), multi-scalar multiplication, point halving, MBNS, sliding window algorithm

CLC Number: