Performance comparison of some addition chain methods based on integer family
Chains; Geometry; Public key cryptography; Addition chains; Competitive performance; Composition method; Computational resources; Elliptic curve cryptography; NP Complete; Performance comparison; Scalar multiplication; Heuristic methods
Saved in:
| Main Authors: | , , , , |
|---|---|
| Other Authors: | |
| Format: | Conference Paper |
| Published: |
Springer Verlag
2023
|
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Tenaga Nasional |
| id |
my.uniten.dspace-25056 |
|---|---|
| record_format |
dspace |
| spelling |
my.uniten.dspace-250562023-05-29T15:31:09Z Performance comparison of some addition chain methods based on integer family Kadir M.F.A. Mohamed M.A. Mohamad R. Mamat M. Muhammed A. 56481265700 57194596063 57203266940 35761412000 25031823000 Chains; Geometry; Public key cryptography; Addition chains; Competitive performance; Composition method; Computational resources; Elliptic curve cryptography; NP Complete; Performance comparison; Scalar multiplication; Heuristic methods A generalized version of an addition chain problem, in which one must find a chain that simultaneously satisfies a sequence on integer in ascending order, is NP-complete. There is no known algorithm which can calculate an optimal addition chain for a given number with any guarantees of reasonable timing or small memory usage. Several methods were introduced to calculate relatively short chain and they are most used to support scalar multiplication operation tailored to limited computational resources in elliptic curve cryptography. In reality, one method is no better than the other except on certain occasions and only for specific integers. In this studies, we evaluate some existing addition chain methods against each other for their competitive performance by categorizing integers into various groups as the input. This result can be used as a benchmark for which method is suitable in which condition anticipated. � 2019, Springer Nature Singapore Pte Ltd. Final 2023-05-29T07:31:08Z 2023-05-29T07:31:08Z 2019 Conference Paper 10.1007/978-981-13-1056-0_22 2-s2.0-85051080270 https://www.scopus.com/inward/record.uri?eid=2-s2.0-85051080270&doi=10.1007%2f978-981-13-1056-0_22&partnerID=40&md5=597449f7448de90d96a9f5deb5ae17d6 https://irepository.uniten.edu.my/handle/123456789/25056 514 211 218 Springer Verlag Scopus |
| institution |
Universiti Tenaga Nasional |
| building |
UNITEN Library |
| collection |
Institutional Repository |
| continent |
Asia |
| country |
Malaysia |
| content_provider |
Universiti Tenaga Nasional |
| content_source |
UNITEN Institutional Repository |
| url_provider |
http://dspace.uniten.edu.my/ |
| description |
Chains; Geometry; Public key cryptography; Addition chains; Competitive performance; Composition method; Computational resources; Elliptic curve cryptography; NP Complete; Performance comparison; Scalar multiplication; Heuristic methods |
| author2 |
56481265700 |
| author_facet |
56481265700 Kadir M.F.A. Mohamed M.A. Mohamad R. Mamat M. Muhammed A. |
| format |
Conference Paper |
| author |
Kadir M.F.A. Mohamed M.A. Mohamad R. Mamat M. Muhammed A. |
| spellingShingle |
Kadir M.F.A. Mohamed M.A. Mohamad R. Mamat M. Muhammed A. Performance comparison of some addition chain methods based on integer family |
| author_sort |
Kadir M.F.A. |
| title |
Performance comparison of some addition chain methods based on integer family |
| title_short |
Performance comparison of some addition chain methods based on integer family |
| title_full |
Performance comparison of some addition chain methods based on integer family |
| title_fullStr |
Performance comparison of some addition chain methods based on integer family |
| title_full_unstemmed |
Performance comparison of some addition chain methods based on integer family |
| title_sort |
performance comparison of some addition chain methods based on integer family |
| publisher |
Springer Verlag |
| publishDate |
2023 |
| _version_ |
1806426075064958976 |