【摘要】 当阶n是光滑的且仅有小素因子时,Pohlig-Hellman算法对于计算离散对数是比较有效的,但是该算法需要调用Shank算法,这使得该算法运行效率并不高.针对这一不足,利用穷尽搜索法消除了Pohlig-Hellman算法中Shank算法的调用.理论分析和实例验证表明,改进算法具有很强的计算能力.更多还原

【Abstract】 When the order n is smooth and has only small prime factors,Pohlig-Hellman algorithm is effective for calculating discrete logarithm. But this algorithm need to call Shank algorithm,it leads to low execution efficiency. The exhaustive search algorithm is applied for escaping to call Shank in order to improve the efficiency.Through theoretical analysis and example verification,the improved algorithm is of high computing power.更多还原