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

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

超椭圆曲线除子标量乘是超椭圆曲线密码体制的核心内容。在双基链的基础上提出了一个广义双基链除子标量乘优化算法。该算法对系数集合中元素数目进行扩展,对基本运算进行预计算,对除子标量乘运算进行优化,最后比较分析算法运算效率。分析表明该算法效率性能方面明显高于其他同类算法。

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.