摘要
在2k进制数乘算法的基础上,提出一种适用于任何二进制长度的快速算法。探讨了引入2k进制k的最佳选取问题,提出一种采用实验方法来选取最佳的k值,并给出了一些更适合于工程实际的k值。实验表明此算法在NIST推荐的5条二进制随机曲线上的数乘算法速度得到了明显的提高。
A fast algorithm for point multipoieation based on 2k base point multiplication algorithm is proposed. It is fit for any binary length. Optimal k of the introduced 2^k sequence representation for number is studied. A new method done by experiment to select k is proposed, then some values fitter for engineering of k are given. Experiment shows the new algorithm speeds up operation obviously on the 5 radom elliptic curves recommended by NIST over F＂′2.
出处
《实验科学与技术》
2008年第5期43-45,共3页
Experiment Science and Technology
关键词
椭圆曲线密码体制
数乘算法
快速算法
elliptic curve cryptography
point multiplication algorthm
fast algorithm
