Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve

Christophe Negre 1, 2 Jean-Marc Robert 2, 1
2 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
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.
Document type :
Conference papers
Liste complète des métadonnées

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01206530
Contributor : Christophe Negre <>
Submitted on : Tuesday, September 29, 2015 - 11:22:19 AM
Last modification on : Monday, December 17, 2018 - 10:54:02 AM
Document(s) archivé(s) le : Wednesday, December 30, 2015 - 10:34:23 AM

File

parallelization-with-push5.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

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

Share

Metrics

Record views

218

Files downloads

312