Speeding up the computations of elliptic
โ
Chi-Sung Laih; Wen-Chung Kuo
๐
Article
๐
1997
๐
Elsevier Science
๐
English
โ 511 KB
The basic operation in elliptic curve cryptoschemes is multiplication. In this paper, we first propose an efficient algorithm for the computation on an elliptic curve. Our algorithm is a combination of the addition-subtraction chains and the "sliding window" variant of the "M-ary method." We then ex