UPM Institutional Repository

Speeding up the elliptic curve scalar multiplication using the window- w non adjacent form


Citation

Al Saffar, Najlae Falah Hameed and Md Said, Mohamad Rushdan (2015) Speeding up the elliptic curve scalar multiplication using the window- w non adjacent form. Malaysian Journal of Mathematical Sciences, 9 (1). pp. 91-110. ISSN 1823-8343; ESSN: 2289-750X

Abstract

Nowadays, elliptic curve based cryptosystem is an efficient public key cryptosystem, The very expensive operation in this cryptographic protocol is the elliptic curve scalar multiplication (elliptic curve point multiplication). Efforts have been mainly focused on developing efficient algorithms for representing the scalar which is involved of elliptic curve scalar multiplication. One of these is using the window- w non adjacent form method. In the present work, the accelerating elliptic curve scalar multiplication using the window- w non adjacent form method is proposed, where the number of operations in the elliptic curve scalar multiplication has been reduced. The expected gain is about 20%, 14% and 7.6% comparing with using the anther methods to compute the elliptic curve scalar multiplication. 20%.


Download File

[img]
Preview
 PDF
38953.pdf
Download (634kB) | Preview

Additional Metadata

Item Type: Article
Divisions: Institute for Mathematical Research
Publisher: Institute for Mathematical Research, Universiti Putra Malaysia
Keywords: Elliptic curve cryptosystems; Elliptic curve scalar multiplication; Non adjacent form; Window- w non adjacent
Depositing User: Nabilah Mustapa
Date Deposited: 04 Sep 2015 13:51
Last Modified: 04 Sep 2015 13:51
URI: http://psasir.upm.edu.my/id/eprint/38953
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item