Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
复制标题
DOI：
10.1007/3-540-44647-8_11
复制
发表时间：
2001-08
期刊：
影响因子：
--
通讯作者：
R. Gallant;R. Lambert;S. Vanstone
中科院分区：
文献类型：
--
作者：
R. Gallant;R. Lambert;S. Vanstone
椭圆曲线密码体制中的基本运算是椭圆曲线点与整数的乘法。本文介绍了一种新的方法，加速这类椭圆曲线上的操作，具有有效的可计算的自同态。新方法的一个优点是，它适用于更大的一类曲线比以前这样的方法。对于这类特殊的曲线，可以预期最高可达50%的加速比最好的一般方法的点乘。
The fundamental operation in elliptic curve cryptographic schemes is the multiplication of an elliptic curve point by an integer. This paper describes a new method for accelerating this operation on classes of elliptic curves that have efficiently-computable endomorphisms. One advantage of the new method is that it is applicable to a larger class of curves than previous such methods. For this special class of curves, a speedup of up to 50% can be expected over the best general methods for point multiplication.