High performance methods of elliptic curve scalar multiplication
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 u...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
Foundation of Computer Science
2014
|
| _version_ | 1825949113652346880 |
|---|---|
| author | Al Saffar, Najlae Falah Hameed Md. Said, Mohamad Rushdan |
| author_facet | Al Saffar, Najlae Falah Hameed Md. Said, Mohamad Rushdan |
| author_sort | Al Saffar, Najlae Falah Hameed |
| collection | UPM |
| description | 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. |
| first_indexed | 2024-03-06T08:39:35Z |
| format | Article |
| id | upm.eprints-37858 |
| institution | Universiti Putra Malaysia |
| last_indexed | 2024-03-06T08:39:35Z |
| publishDate | 2014 |
| publisher | Foundation of Computer Science |
| record_format | dspace |
| spelling | upm.eprints-378582015-09-25T01:46:21Z http://psasir.upm.edu.my/id/eprint/37858/ High performance methods of elliptic curve scalar multiplication Al Saffar, Najlae Falah Hameed Md. Said, Mohamad Rushdan 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. Foundation of Computer Science 2014-12 Article PeerReviewed 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 http://www.ijcaonline.org/archives/volume108/number20/19028-0047 10.5120/19028-0047 |
| spellingShingle | Al Saffar, Najlae Falah Hameed Md. Said, Mohamad Rushdan High performance methods of elliptic curve scalar multiplication |
| title | High performance methods of elliptic curve scalar multiplication |
| title_full | High performance methods of elliptic curve scalar multiplication |
| title_fullStr | High performance methods of elliptic curve scalar multiplication |
| title_full_unstemmed | High performance methods of elliptic curve scalar multiplication |
| title_short | High performance methods of elliptic curve scalar multiplication |
| title_sort | high performance methods of elliptic curve scalar multiplication |
| work_keys_str_mv | AT alsaffarnajlaefalahhameed highperformancemethodsofellipticcurvescalarmultiplication AT mdsaidmohamadrushdan highperformancemethodsofellipticcurvescalarmultiplication |