| 椭圆曲线上点的数乘中窗口最佳长度的选取 |
| |
| 引用本文： | 郝林,储颖,张雁.椭圆曲线上点的数乘中窗口最佳长度的选取[J].计算机工程与设计,2004,25(1):17-18,32. |
| |
| 作者姓名： | 郝林 储颖 张雁 |
| |
| 作者单位： | 云南大学,计算机科学与工程系,云南,昆明,650091 |
| |
| 基金项目： | 国家973项目(G1998030420)，云南省自然科学基金项目(2002F0010M)，云南省信息网络开发技术专项计划项目(2001I710) |
| |
| 摘 要： | 椭圆曲线密码体制中加、解密速度提高的关键在于加速椭圆曲线上点乘运算的效率。基本的方式之一是缩短大数的二进制序列长度，将其二进制序列划分为若干个“窗口”，构造一新的等价的2^k进制序列。在讨论了对应不同长度的二进制序列转换成2^k进制序列后，确立“窗口”长度k值的最佳选取，使得在这种选取下椭圆曲线上点乘运算的效率最高。
|
| 关 键 词： | 椭圆曲线 密码 点乘运算 二进制序列 窗口 最佳长度 |
| 文章编号： | 1000-7024(2004)01-0017-02 |
Best of all windows for point multiplication in elliptic curve cryptos ystems |
| |
| HAD Lin,CHU Ying,ZHANG Yan.Best of all windows for point multiplication in elliptic curve cryptos ystems[J].Computer Engineering and Design,2004,25(1):17-18,32. |
| |
| Authors: | HAD Lin CHU Ying ZHANG Yan |
| |
| Abstract: | To improve rate of encryption and decryption in the elliptic curve cryptosystems, the key is key to calculate fast for the point multiplication. A basic form is to shrink the length of the 2 sequence representation of a number, and 2k sequence representation is consisted of dividing some "windows" in the 2 sequence representation. When the 2 sequence representation is changed, the 2k sequence representation, the optimum length of the windows for k is presented, so the best of all efficiency of the algorithm can be obtained. |
| |
| Keywords: | fast algorithm k-value optimal choice |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
