Performance comparison of some addition chain methods based on integer family
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 ti...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Conference Paper |
| Language: | English |
| Published: |
2020
|
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Universiti Tenaga Nasional |
| Language: | English |
| Summary: | 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. |
|---|