Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing

Mohammad Anagreh, Eero Vainikko, Peeter Laud

Abstract

The aim of Elliptic Curve Cryptosystems (ECC) is to achieve the same security level as RSA but with shorter key size. The basic operation in the ECC is scalar multiplication which is an expensive operation. In this paper, we focus on optimizing ECC scalar multiplication based on Non-Adjacent Form (NAF). A new algorithm is introduced that combines an Add-Subtract Scalar Multiplication Algorithm with NAF representation to accelerate the performance of the ECC calculation. Parallelizing the new algorithm shows an efficient method to calculate ECC. The proposed method has speed up the calculation up to 60% compared with the standard method.

Download


Paper Citation


in Harvard Style

Anagreh M., Vainikko E. and Laud P. (2019). Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing.In Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP, ISBN 978-989-758-359-9, pages 238-245. DOI: 10.5220/0007312702380245


in Bibtex Style

@conference{icissp19,
author={Mohammad Anagreh and Eero Vainikko and Peeter Laud},
title={Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing},
booktitle={Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,},
year={2019},
pages={238-245},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0007312702380245},
isbn={978-989-758-359-9},
}


in EndNote Style

TY - CONF

JO - Proceedings of the 5th International Conference on Information Systems Security and Privacy - Volume 1: ICISSP,
TI - Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing
SN - 978-989-758-359-9
AU - Anagreh M.
AU - Vainikko E.
AU - Laud P.
PY - 2019
SP - 238
EP - 245
DO - 10.5220/0007312702380245