Computer and Modernization

Previous Articles     Next Articles

A Flexible Parallelization Method for Elliptic Curve Cryptosystems

  

  1. (Computer School, Shenzhen Institute of Information Technology, Shenzhen 518172, China)
  • Received:2017-06-06 Online:2018-03-08 Published:2018-03-09

Abstract: This paper proposes a flexible parallel method of scalar multiplication for elliptic curve cryptosystems (ECC) based on the proposed scalar partition and integration models. Focusing on parallelizing ECC scalar multiplication operations at the scalar multiplication algorithm level, the proposed method can be implemented into various parallel systems. In contrast to previous parallel scalar multiplication methods, the proposed method is flexible. Furthermore, the time complexity of the proposed parallel scalar multiplication method can be reduced to (logk)A+kD. The optimal time complexity of the proposed method is reduced about 30% compared with classic binary method by an example.

Key words: elliptic curve cryptosystems, scalar multiplication, parallel computing, parallel systems, binary method

CLC Number: