Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM

Mohammad Anagreh, Eero Vainikko, Peeter Laud

Abstract

In this paper, we study the parallel implementations of elliptic curve scalar multiplication over prime fields using signed binary representations. Our implementation speeds up the calculation of scalar multiplication in comparison with the standard case. We introduce parallel algorithms for computing elliptic curve scalar multiplication based on representing the scalar by the Complementary Recoding Technique (CRT) and the Direct Recording Method (DRM). Both implementations of the proposed algorithms show speed-ups reaching up to 60% in comparison with execution time for sequential cases of the algorithms. We find that ECC-DRM is faster than ECC-CRT in both parallel and sequential counterparts.

Download


Paper Citation


in Harvard Style

Anagreh M., Vainikko E. and Laud P. (2020). Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM.In Proceedings of the 6th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-399-5, pages 176-184. DOI: 10.5220/0009129501760184


in Bibtex Style

@conference{icissp20,
author={Mohammad Anagreh and Eero Vainikko and Peeter Laud},
title={Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM},
booktitle={Proceedings of the 6th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2020},
pages={176-184},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0009129501760184},
isbn={978-989-758-399-5},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 6th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM
SN - 978-989-758-399-5
AU - Anagreh M.
AU - Vainikko E.
AU - Laud P.
PY - 2020
SP - 176
EP - 184
DO - 10.5220/0009129501760184