Speeding up the elliptic curve scalar multiplication using the window- w non adjacent form
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...
Saved in:
Main Authors: | Al Saffar, Najlae Falah Hameed, Md Said, Mohamad Rushdan |
---|---|
Format: | Article |
Language: | English |
Published: |
Institute for Mathematical Research, Universiti Putra Malaysia
2015
|
Online Access: | http://psasir.upm.edu.my/id/eprint/38953/1/38953.pdf http://psasir.upm.edu.my/id/eprint/38953/ http://einspem.upm.edu.my/journal/fullpaper/vol9/7.%20najlae.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
High performance methods of elliptic curve scalar multiplication
by: Al Saffar, Najlae Falah Hameed, et al.
Published: (2014) -
Development of some fast and efficient methods for elliptic curve scalar multiplication over prime fields
by: Al-Saffar, Najlae Falah Hameed
Published: (2015) -
Pseudo T - adic non adjacent form for scalar multiplication on Koblitz Curves
by: Yunos, Faridah, et al.
Published: (2015) -
Pseudo τ - adic non adjacent form for scalar multiplication on Koblitz curves
by: Yunos, Faridah, et al.
Published: (2015) -
Pseudo τ - adic non adjacent form for scalar multiplication on Koblitz curves
by: Yunos, Faridah, et al.
Published: (2014)