在离散对数困难问题的条件下，利用不经意多项式估值协议和拉格朗日插值多项式来解密s2(方案2)。
Under the condition of a discrete logarithm problem, S2 is decrypted by the OPE (Oblivious Polynomial Evaluation) protocol and Lagrange Interpolation Polynomial (scheme 2).
文中提出了一个新的群签名方案，该方案的安全性基于离散对数困难问题，其运行效率比已有的同类方案高。
A new group signature scheme based on the discrete logarithm problem is presented. The scheme is more efficient than the previously known schemes with the same security properties.
基于中国剩余定理，零知识证明与有限域上计算离散对数问题的困难性，提出了一种新的动态多秘密分享方案。
Based on the zero -knowledge proofs and the computational difficulty of computing discrete logarithms, a dynamic multiple secrets sharing scheme is proposed in this paper.
代理签名体制在电子商务中的应用很广泛，目前的代理签名体制安全性主要是基于求解大数因子分解问题的困难性或求解离散对数问题的困难性。
Proxy signature systems have great applications in e-business whose secure-ty is based on the difficulty of integer factoring or the difficulty of solving the common discrete logarithm problem.
该文描述了代数几何与ecc的数学基础及椭圆曲线离散对数问题困难性，讨论了ECC在电子商务中的安全应用。
This paper describes the mathematics base of algebraic geometry and ECC. It also discusses the elliptic curve discrete logarithm problem (ECDLP) and the security applications of ECC on E-commerce.
方案的安全是基于解离散对数为困难问题。
The safety of this scheme is based on the intractable problem of solving Discrete Logarithm.
方案的安全是基于解离散对数为困难问题。
The safety of this scheme is based on the intractable problem of solving Discrete Logarithm.
应用推荐