Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve

Christophe Negre (1, 2) , Jean-Marc Robert (2, 1)

1 UPVD - Université de Perpignan Via Domitia
2 DALI - Digits, Architectures et Logiciels Informatiques

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. For the curves B409 and Curve25519 the proposed approaches improve by at least 10% the computation time of the scalar multiplication.

Mots clés: Parallel implementation; Scalar multiplication; Prime field; Binary field; Elliptic curve

Domaines: Cryptographie et sécurité [cs.CR]

Christophe Negre, Jean-Marc Robert. Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve. SECRYPT 2015 - 12th International Conference on Security and Cryptography, Jul 2015, Colmar, France. pp.202-209, ⟨10.5220/0005512502020209⟩. ⟨hal-01206530⟩