Speeding up the computations of elliptic curves cryptoschemes

✍ Scribed by Chi-Sung Laih; Wen-Chung Kuo

• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 511 KB
• Volume: 33
• Category: Article
• ISSN: 0898-1221
• DOI: 10.1016/s0898-1221(97)00017-5

✦ Synopsis

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 extend the idea to the case of multi-multiplication on the elliptic curve. It is shown that the performances of both algorithms are superior to the previous methods.