【摘要】 超椭圆曲线密码体制中最重要且最耗时的运算就是除子的标量乘运算,为了提高它的运算速度,给出了一个同时求多个域元素逆的有效算法,该算法的特点是后面运算有效地利用了前面运算的结果,减少了运算量,提高了速度.利用该算法得到的标量乘算法比Lange给出的标量乘算法快32%～35%,比Mishra等人给出的改进算法分别快49%～53%和6%～7%,并且该算法能够抵抗边信道攻击.更多还原

【Abstract】 In hyperelliptic curve croptosystem, the most important and computationally costliest operation is the scalar multiplication. To speed up, an efficient algorithm for simultaneously obtaining the inverses of a list of underlying field elements is given. The feature of the algorithm is that the later arithmetics make efficient use of the results of the former ones. The algorithm decreases the number of arithmetics and saves time. The scalar multiplication algorithm with the efficient algorithm for inversion is 32%~35% faster than the scalar multiplication algorithm given by Lange and 49%~53% or 6%~7% faster than the improved scalar multiplication algorithms given by Mishra and others, and provides protection agatinst side-channel attacks.更多还原