传统的基于有限域的离散对数问题因为可以使用指标计算方法而存在亚指数时间算法求解。

The classical discrete logarithm problem in finite prime fields can be solved in an expected time which is subexponential in the group size via the socalled index calculus method.

youdao

在本论文中，我们证明了假如离散对数的问题解决了，何的数位签章演算法是不安全的。

In this paper, we show that he's digital signature scheme is insecure against forgery if the discrete logarithms problem is solved.

youdao

对数据离散化及属性选择度量方法作了改进，以降低计算复杂度，提高算法学习速度。

For decreasing calculation complexity and increasing speed of algorithm learning, it presented some improvement of data discretization and attributes selection measure.

youdao