Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve

Abstract

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.
Fichier principal
Vignette du fichier
parallelization-with-push5.pdf (394.51 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01206530 , version 1 (29-09-2015)

Identifiers

Cite

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⟩
231 View
556 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More