欢迎您！东篱公司
退出
-
申报数据库
-
立项数据库
-
成果数据库
-
项目获奖数据库
中文摘要：
在求解离散对数问题上有袋鼠攻击、生日攻击、小步一大步攻击、指数积分攻击等多种方法，而小步一大步攻击算法是比较通用且高效的。为了提高攻击算法的速度，改善算法的效率，提出的改进算法牺牲了适当的存储空间，但在运算之前通过奇偶判断筛选过程减少了判断的次数甚至有数量级的减少。性能分析表明，改进的算法在性能上优于原算法。并且预处理过程中产生的数据可以重复利用来求解同一群下不同生成元的离散对数问题，这又进一步减少了算法的运算复杂度。
英文摘要：
There are kangaroo attack,birthday attack,baby-step-giant-step attack, exponential integral attack and other methods in sol- ving the discrete logarithm problem. The baby-step-giant-step attack algorithm is more versatile and efficient. In order to improve the speed of the attack algorithm and the efficiency of the algorithm, the algorithm proposed is improved at the expense of the appropriate storage space. By the parity operator before the judge selection process reduce the number of judgment,even the reduction of the magni- tude. The performance analysis shows that the improved algorithm outperforms the original algorithm. And the data generated in the pre- treatment process can be reused to solve the problem of the generator under the same group of discrete logarithm. This further reduces the computational complexity of the algorithm.
同期刊论文项目
同项目期刊论文
期刊信息
位置：