| 基域F(2m)上椭圆曲线快速算法的分析与比较 |
| |
| 引用本文： | 刘瑞芹. 基域F(2m)上椭圆曲线快速算法的分析与比较[J]. 华北科技学院学报, 2008, 5(3): 86-88 |
| |
| 作者姓名： | 刘瑞芹 |
| |
| 作者单位： | 华北科技学院基础部,北京东燕郊,101601 |
| |
| 基金项目： | 华北科技学院院内科研基金项目B-05-34 |
| |
| 摘 要： | 研究了域F（2m）上椭圆曲线算法的快速实现，介绍了标量乘法的四种快速优化算法，并对这四种快速算法的特点进行了详细的分析与比较，分析与比较表明，最高效的快速算法是将NAF与变长滑动窗口算法结合起来。
|
| 关 键 词： | 椭圆曲线 仿射坐标系 标量乘法 点加运算 |
Analysis and Comparison about Elliptic Curves Fast Algorithm Based on Field F(2m) |
| |
| LIU Ruiqin. Analysis and Comparison about Elliptic Curves Fast Algorithm Based on Field F(2m)[J]. Journal of North China Institute of Science and Technology, 2008, 5(3): 86-88 |
| |
| Authors: | LIU Ruiqin |
| |
| Affiliation: | LIU Ruiqin (Department of Basic Curriculum, North China Institute of Science and Technology, Yanjiao Beijing-East 101601) |
| |
| Abstract: | In this paper, we study on the fast implementation of Elliptic Curve Cryptography based on field F（2m）, and introduce four kinds of fast optimization algorithms of scalar multiplication, according to the features of them, we did detailed analysis and comparison. The results showed that, the most efficient fast algorithm is combining NAF with variable-length-sliding window algorithm. |
| |
| Keywords: | Elliptic curves Affine coordinate system Scalar multiplication Point addition |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
