摘要
椭圆曲线密码体制的快速实现取决于标量乘算法的运算效率。在传统的(2,3)-双基数标量乘算法的基础上,提出了一种新的(2,5)-双基数标量乘算法。实验数据表明,该算法不仅继承了双基数标量乘算法的优点,同时还改进了传统双基数标量乘算法的不足,如预计算时间长和存储空间要求大等问题,使其应用于存储空间较小的领域如智能卡等成为可能。
The performance of elliptic curve cryptosystems has heavily depended on the efficient computation of scalar multiplication.Based on the traditional double-base chain representation of scalar using bases 2 and 3.This paper develops a new double-base chain scalar multiplication algorithm with power of 2 and 5.Compared with the standard algorithm,the experimental results show the method has greatly relieved the burden of precomputation and saved the space of memory,which makes it possible for its application to the fields with small space of memory requirement such as IP card and IC card etc.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第26期98-102,202,共6页
Computer Engineering and Applications
基金
高等职业教育技能鉴定评价体系重点课题(No.09-2-107)
关键词
双基数系统
标量乘
固定基窗口算法
五倍点
double-base number systems
scalsar multiplication
fixed-base windowing method
quintupling