This paper deals with parallel implementation of scalar multiplication over an elliptic curve. We present parallel approaches which split the scalar into two parts for E(F p ) or three parts for E(F 2 m ) and perform in parallel the scalar multiplication with each part of the scalar. We present timing results of these approaches implemented over an Intel Core i7 for NIST binary curves B233, B409 and for the twisted Edwards curve Curve25519 (Bernstein, 2006) . For the curves B409 and Curve25519 the proposed approaches improve by at least 10% the computation time of the scalar multiplication.
New parallel approaches are proposed by Negre et al REF , they introduced parallel approaches which split the scalar multiplication based on NAF into two parts for the prime field F p , and three parts for the binary field F 2 m .
Parallel approaches for efficient scalar multiplication over elliptic curve
2015 12th International Joint Conference on e-Business and Telecommunications (ICETE)
2015 12th International Joint Conference on e-Business and Telecommunications (ICETE)
Computer Science