Citation
Al Saffar, Najlae Falah Hameed and Md. Said, Mohamad Rushdan
(2014)
High performance methods of elliptic curve scalar multiplication.
International Journal of Computer Applications, 108 (20).
pp. 39-45.
ISSN 0975-8887
Abstract
Elliptic curve scalar multiplication is the operation of successively adding a point along an elliptic curve to itself k times. It is used in elliptic curve cryptography (ECC) as a means of producing a trapdoor function. In this paper, algorithms to compute the elliptic curve scalar multiplication using a special form for integers will introduce, and then two types of signed digit representation will use. The signed digit form of the scalar is calculated by many types of algorithms such as binary , non adjacent form and direct recoding. The results indicate that the proposed methods perform better to compute the scalar multiplication on elliptic curves and it is more efficient than the existing methods.
Download File
Full text not available from this repository.
Official URL or Download Paper: http://www.ijcaonline.org/archives/volume108/numbe...
|
Additional Metadata
| Item Type: | Article |
|---|---|
| Divisions: | Institute for Mathematical Research |
| DOI Number: | https://doi.org/10.5120/19028-0047 |
| Publisher: | Foundation of Computer Science |
| Keywords: | Elliptic curve cryptosystem; Elliptic curve scalar multiplication; Signed digit representation |
| Depositing User: | Nabilah Mustapa |
| Date Deposited: | 25 Sep 2015 01:46 |
| Last Modified: | 25 Sep 2015 01:46 |
| Altmetrics: | http://www.altmetric.com/details.php?domain=psasir.upm.edu.my&doi=10.5120/19028-0047 |
| URI: | http://psasir.upm.edu.my/id/eprint/37858 |
| Statistic Details: | View Download Statistic |
Actions (login required)
 |
View Item |