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.
传统的基于有限域的离散对数问题因为可以使用指标计算方法而存在亚指数时间算法求解。
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.
传统的基于有限域的离散对数问题因为可以使用指标计算方法而存在亚指数时间算法求解。
应用推荐