摘要
为了提高基于椭圆曲线密码系统的各种运算效率,提出了一种椭圆曲线上联合稀疏表(JSF)算法的改进算法,并对改进算法的运算效率进行了分析。分析结果表明,与改进前相比,该改进算法平均可以减少0.37次倍点运算,从而使总的运算量达到更低,而运算效率更高。如果以现有加密强度来衡量的话,算法效率可以提高0.15%。
This paper proposes an improved Joint Spare Form（JSF） algorithm of elliptic curve. The analysis of the improved algorithm shows that it can reduce the calculation amount of multiplication, therefore the overall efficiency is improved. Compared with the original algorithm, the improved algorithm can increase the efficiency by 0.15% if evaluated with the existing e ncryption strength.
出处
《信息与电子工程》
2009年第6期613-616,共4页
information and electronic engineering
关键词
椭圆曲线
双标量乘
倍点运算
联合稀疏表算法
elliptic curve
double scalar multiplications
point multiply
Joint Spare Form algorithm
