Keyword Search:


Bookmark and Share

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

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

[img] PDF
619Kb

Official URL: http://einspem.upm.edu.my/journal/fullpaper/vol9/7...

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%.

Item Type:Article
Keyword:Elliptic curve cryptosystems; Elliptic curve scalar multiplication; Non adjacent form; Window- w non adjacent
Faculty or Institute:Institute for Mathematical Research
Publisher:Institute for Mathematical Research, Universiti Putra Malaysia
ID Code:38953
Deposited By: Nabilah Mustapa
Deposited On:04 Sep 2015 21:51
Last Modified:04 Sep 2015 21:51

Repository Staff Only: Edit item detail

Document Download Statistics

This item has been downloaded for since 04 Sep 2015 21:51.

View statistics for "Speeding up the elliptic curve scalar multiplication using the window- w non adjacent form "