摘要
除子标量乘是超椭圆曲线密码体制中的关键运算.基于单除子标量乘的思想,将Duursma与Sakurai给出的关于奇素数域上一类特殊超椭圆曲线上的一个除子标量乘算法推广到奇素数域扩域上更一般的此类超椭圆曲线上,得到了两个效率更高的公式化的除子标量乘新算法.这两算法所需的运算量比二元法降低12%以上.
Divisor scalar multiplication is the key operation in hyperelliptic curve cryptosystem.Based on the idea of simple divisor scalar multiplicafions,Duursma and Sakurai＇s algorithm for divisor scalar multiplications on a special class of hyperelliptic curves over prime fields has been improved to a larger class of such hyperelliptic curves over prime-extension fields, and two new formulized algorithms for divisor scalar multiplications are proposed. Compared with binary method,onr algorithms are much more efficient and take at leas 12% less computation amount.
出处
《电子学报》
EI
CAS
CSCD
北大核心
2008年第10期2049-2054,共6页
Acta Electronica Sinica
基金
国家自然科学基金(No.60763009)
教育部科学技术研究重点项目(No.207089)
海南省自然科学基金(No.80528)
关键词
超椭圆曲线
超椭圆曲线密码体制
单除子
除子标量乘
算法
hypcrelliptic curve
hyperelliptic curve cryptosystems
simple divisor
divisor scalar multiplication
algorithm
