Abstract
Finding a shorter addition/subtractionchain for an integer is an important problem for many cryptographic systems based on number theory. Especially, execution time of multiplication on an elliptic curve cryptosystem is directly proportional to the length of the addition/subtractionchain. In this paper, we propose an algorithm to find an addition/subtractionchain. The proposed algorithm is based on the smallwindow method, and reduces the number of windows by using subtractions. We show the proposed algorithm finds the shorter addition/subtractionchain than what can be found by any other previous algorithm.
| Original language | English |
|---|---|
| Pages (from-to) | 34-40 |
| Number of pages | 7 |
| Journal | International Journal of Network Security |
| Volume | 2 |
| Issue number | 1 |
| State | Published - 2006 |
Keywords
- Addition/subtractionchain
- Elliptic curve cryptosystem
- Public key cryptosystem