A hybrid addition chain method for faster scalar multiplication
Solutions to addition chain problem can be applied to operations involving huge number such as scalar multiplication in elliptic curve cryptography. Recently, a decomposition method was introduced, with an intention to generate addition chain with minimal possible terms. Totally different from oth...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://eprints.unisza.edu.my/5033/1/FH02-FIK-16-04820.pdf http://eprints.unisza.edu.my/5033/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Solutions to addition chain problem can be applied to operations involving huge number such as scalar
multiplication in elliptic curve cryptography. Recently, a decomposition method was introduced, with an intention
to generate addition chain with minimal possible terms. Totally different from others, this new method uses rule
representation for prime factors of n, and a new algorithm to generate a complete chain for n. Although the chain
is not always optimal, the method is shown to outclass other existing methods for certain cases of n. The method
is based on prime power decomposition and it can be seen as a two-layered approach, prime layer and prime
power layer. In this paper, we adapt an idea of non-adjacent form into decomposition method at prime layer. This
new hybrid method is called signed decomposition method. Our objective is to reduce the number of addition
operations for each p by transforming an original unsigned rule into a signed rule. The study shows that the length
of this new chain is confined to the same boundary as that of an optimal chain. A series of tests shows that our
method outperforms decomposition method as well as earlier methods significantly. Moreover, possible saving of
terms can be made more noticeable as we increase the prime factor. |
|---|