| 椭圆曲线密码体制中标量乘法的快速算法 |
| |
| 引用本文： | 刘连浩,申勇.椭圆曲线密码体制中标量乘法的快速算法[J].计算机应用研究,2009,26(3):1104-1108. |
| |
| 作者姓名： | 刘连浩 申勇 |
| |
| 作者单位： | 中南大学,信息科学与工程学院,长沙,410083 |
| |
| 摘 要： | 求逆是标量乘法中最耗时的运算，求逆运算次数的多少直接决定标量乘法的性能。转换求逆为乘法运算能够降低求逆次数。根据这种思想，提出了素域Fp上用仿射坐标直接计算3P+Q的算法，其运算量为1I+3S+16M，比Ciet等人提出的方法节省了一次求逆运算。同时还给出直接计算3kP的算法，该算法比重复计算k次3P更有效。最后结合3-NAFw的编码方法，把两个新算法应用到标量乘法中。结果表明，运用3P+Q、3kP的标量乘法比传统的NAF、NAF4等方法更有效，相交处I/M的值可降为5.4。
|
| 关 键 词： | 椭圆曲线密码体制 标量乘法 仿射坐标 求逆 |
Fast algorithm for scalar multiplication in elliptic curves cryptography |
| |
| LIU Lian-hao,SHEN Yong.Fast algorithm for scalar multiplication in elliptic curves cryptography[J].Application Research of Computers,2009,26(3):1104-1108. |
| |
| Authors: | LIU Lian-hao SHEN Yong |
| |
| Affiliation: | School of Information Science & Engineering;Central South University;Changsha 410083;China |
| |
| Abstract: | A field inversion is the most expensive operation on scalar multiplication,and the number of inversion determines the performance of scalar multiplication.Trading inversions for multiplications can decrease the number of inversion.Based on the idea,this paper proposed an efficient algorithm to compute 3P+Q directly over Fp in terms of affine coordinates,its computational complexity was 1I+3S+16M,saving one field inversion compared to Ciet's method.Moreover,also gave an improvement to compute 3kP directly,wh... |
| |
| Keywords: | NAF |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
