Abstract
Some fast algorithms for scalar multiplication on elliptic curves are put forward and their characteristics analyzed. In order to get over the shortage of non-adjacent form (NAF) method, a new improved NAF window method introduced. Compared to other methods, this improved method significantly reduces the number of point-additions and the number of point-doublings in scalar multiplication, and the efficiency of computation found to be increased by 25%.
| Original language | English |
|---|---|
| Pages (from-to) | 701-704 |
| Number of pages | 4 |
| Journal | Beijing Ligong Daxue Xuebao/Transaction of Beijing Institute of Technology |
| Volume | 25 |
| Issue number | 8 |
| Publication status | Published - Aug 2005 |
Keywords
- Elliptic curve cryptography
- Fast algorithms
- Non-adjacent form (NAF)
- Scalar multiplication