| 椭圆曲线密码体制中点乘的快速算法 |
| |
| 引用本文： | 陶然,陈丽燕.椭圆曲线密码体制中点乘的快速算法[J].北京理工大学学报,2005,25(8):701-704. |
| |
| 作者姓名： | 陶然 陈丽燕 |
| |
| 作者单位： | 北京理工大学,信息科学技术学院电子工程系,北京,100081 |
| |
| 基金项目： | 高等学校优秀青年教师教学科研奖励计划 |
| |
| 摘 要： | 对已有的计算椭圆曲线密码体制中点乘的常用算法进行性能分析,在此基础上,针对非相邻形式算法(NAF)存在的不足,提出一种改进的基于NAF的窗口算法,并与其它的几种算法进行了比较.结果表明,改进算法减少了点乘运算中点加和倍乘的运算次数,运算效率比一般的二进制算法提高了25%.
|
| 关 键 词： | 椭圆曲线密码体制 点乘 快速算法 非相邻形式(NAF) 椭圆曲线密码体制 点乘运算 快速算法 Elliptic Curve Cryptography Multiplication Scalar Algorithm 二进制 效率比 倍乘 改进算法 结果 比较 窗口算法 存在 非相邻形式 性能分析 常用算法 计算 |
| 文章编号： | 1001-0645(2005)08-0701-04 |
| 收稿时间： | 10 12 2004 12:00AM |
| 修稿时间： | 2004年10月12日 |
Fast Algorithm for Scalar Multiplication in Elliptic Curve Cryptography |
| |
| TAO Ran and CHEN Li-yan.Fast Algorithm for Scalar Multiplication in Elliptic Curve Cryptography[J].Journal of Beijing Institute of Technology(Natural Science Edition),2005,25(8):701-704. |
| |
| Authors: | TAO Ran and CHEN Li-yan |
| |
| Institution: | Department of Electronic Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China;Department of Electronic Engineering, School of Information Science and Technology, Beijing Institute of Technology, Beijing100081, China |
| |
| Abstract: | Some fast algorithms for scalar multiplication on elliptic curves are put forward and their characteristics analyzed. In order to get over the shortage of non-adjacent form (NAF) method, a new improved NAF window method introduced. Compared to other methods, this improved method significantly reduces the number of point-additions and the number of point-doublings in scalar multiplication, and the efficiency of computation found to be increased by 25%. |
| |
| Keywords: | elliptic curve cryptography scalar multiplication fast algorithms non-adjacent form (NAF) |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
| 点击此处可从《北京理工大学学报》下载免费的PDF全文 |
