Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve

Christophe Negre, Jean-Marc Robert

2015

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(Fp) or three parts for E(F2m ) 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.

Paper Citation

in Harvard Style

Negre C. and Robert J. (2015). Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve . In Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015) ISBN 978-989-758-117-5, pages 202-209. DOI: 10.5220/0005512502020209

in Bibtex Style

@conference{secrypt15,
author={Christophe Negre and Jean-Marc Robert},
title={Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve},
booktitle={Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015)},
year={2015},
pages={202-209},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005512502020209},
isbn={978-989-758-117-5},
}

in EndNote Style

TY - CONF
JO - Proceedings of the 12th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2015)
TI - Parallel Approaches for Efficient Scalar Multiplication over Elliptic Curve
SN - 978-989-758-117-5
AU - Negre C.
AU - Robert J.
PY - 2015
SP - 202
EP - 209
DO - 10.5220/0005512502020209