Refined computations for points of the form 2kP based on Montgomery trick

被引:1
|
作者
Adachi, D [1 ]
Hirata, T
机构
[1] Nagoya Univ, Grad Sch Engn, Nagoya, Aichi 4648603, Japan
[2] Nagoya Univ, Grad Sch Informat Sci, Nagoya, Aichi 4648603, Japan
来源
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES | 2006年 / E89A卷 / 01期
关键词
scalar multiplication; elliptic curve arithmetic; Montgomery trick; window method;
D O I
10.1093/ietfec/e89-a.1.334
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This paper focuses on algorithms for an efficient scalar multiplication. It proposes two algorithms for computing points of the form 2(k)p in affine coordinates. One works for k = 2, and the other works for an arbitrary natural number k. The efficiency of these algorithms is based on a trade-off between a field inversion and several field multiplications. Montgomery trick is used to implement this trade-off. Since a field inversion is usually more expensive than 10 field multiplications, the proposed algorithms are efficient in comparison with existing ones.
引用
收藏
页码:334 / 339
页数:6
相关论文
共 5 条