|
|
|
| A fast algorithm for the point multiplication in elliptic curve cryptosystems |
| ①Hao Lin; Luo Ping② |
| ①Dept. of Computer Science and Engineering Yunnan University Kunmin 650091 China;②Dept. of Computer Science and Technology Tsinghua University Beijing 100084 China |
|
|
|
|
Abstract In this paper, a new fast algorithm for the numerical multiplication of the points on elliptic curves is presented. By introducing 2k sequence representation for number, the length of numerical multiplication is shortened, so that the number of addition operation on elliptic curves is decreased greatly. Moreover, the optimal choice of k is analyzed and the efficiency of the algorithm presented is improved about 60.
|
|
Received: 28 May 2001
|
|
|
|
|
|
|
|
|
2003, Vol. 25 
