论文部分内容阅读
本文给出了椭圆曲线群上直接计算2kP的一般算法,该算法与基域的特征无关,从P直接计算2kP,不需要计算中介点,比k次倍乘快,其实现效率与投射坐标下的算法相当。在特定的基域和椭圆曲线方程下,该算法可推导出文献[1]和[2]中给出的算法。并且我们给出了在Montgomery形式下的算法。
In this paper, we give a general algorithm for calculating 2kP directly on elliptic curve groups. This algorithm has nothing to do with the features of base-field. Calculating 2kP directly from P does not need to calculate the intermediary point. The algorithm is quite. This algorithm deduces the algorithms given in [1] and [2] for a given base-field and elliptic curve equation. And we give the algorithm in the form of Montgomery.