基于广义双基链的除子标量乘优化算法  

ON OPTIMIZED ALGORITHM OF DIVISOR SCALAR MULTIPLICATION BASED ON EXTENDED DOUBLE-BASE CHAIN

作　　者：叶志勇[1,2] 王娟[1,2] 朱艳琴[1,2] 罗喜召[1,2] 

机构地区：[1]苏州大学计算机科学与技术学院,江苏苏州215006 [2]江苏省计算机信息处理新技术重点实验室,江苏苏州215006

出　　处：《计算机应用与软件》2010年第2期14-15,39,共3页Computer Applications and Software

基　　金：国家自然科学基金项目(60673041)

摘　　要：超椭圆曲线除子标量乘是超椭圆曲线密码体制的核心内容。在双基链的基础上提出了一个广义双基链除子标量乘优化算法。该算法对系数集合中元素数目进行扩展,对基本运算进行预计算,对除子标量乘运算进行优化,最后比较分析算法运算效率。分析表明该算法效率性能方面明显高于其他同类算法。Scalar multiplication using divisor in hyperelliptic curves is the core of the hyperelliptic curve cryptosystem. Based on double- based chain, this paper proposes an optimized extended double-base chain algorithm. The optimized algorithm extends the number of elements in coefficient set, makes some pre-computations for the basic operation, optimizes the divisor scalar multiplication and finally analyses the efficiency of the algorithm by comparing with other scalar multiplication algorithm. The analysis shows that the efficiency of this algorithm is superior to others in this aspect.

关 键 词：广义双基链 标量乘 超椭圆曲线 除子 

分 类 号：TP309.7[自动化与计算机技术—计算机系统结构] O242.23[自动化与计算机技术—计算机科学与技术]