【摘要】 文章提出计算椭圆曲线上离散对数的Pohlig—Hellman方法。如果椭圆曲线上的点P的阶N只有小的素因子,那么这种方法的复杂度是O(log_bN)~2。因此在椭圆曲线密码体制的构造中应避免这种情况的发生。更多还原

【Abstract】 To compute the discrete logarithms on elliptic curves E(Fq), an algorithm is developed based on Pohlig - Hellman method. Our algorithm requires O(log2 N)2 complexity, if N which is the order of the primitive element P on the elliptic curves has only small prime factors.更多还原