摘要
对已有的计算椭圆曲线密码体制中点乘的常用算法进行性能分析,在此基础上,针对非相邻形式算法(NAF)存在的不足,提出一种改进的基于NAF的窗口算法,并与其它的几种算法进行了比较.结果表明,改进算法减少了点乘运算中点加和倍乘的运算次数,运算效率比一般的二进制算法提高了25%.
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 pointdoublings in scalar multiplication, and the efficiency of computation found to he increased by 25%.
出处
《北京理工大学学报》
EI
CAS
CSCD
北大核心
2005年第8期701-704,共4页
Transactions of Beijing Institute of Technology
基金
高校青年教师教学科研奖励基金项目
关键词
椭圆曲线密码体制
点乘
快速算法
非相邻形式(NAF)
elliptic curve cryptography
scalar multiplication
fast algorithms
non-adjacent form（NAF）
