一种方案的安全性证明是基于离散对数问题；
The security proof of the first scheme is based on the disperse logarithm problem (DLP);
它们的安全性都是基于椭圆曲线离散对数问题。
All of their security is based on elliptic curve discrete logarithm problem.
该方案在离散对数问题和随机预言模型假设下是安全的。
The scheme is secure under the assumption of the intractability of logarithm problems and the random oracle model.
两种方案的安全性都是基于椭圆曲线离散对数问题的难解性。
Both of their security are based on the intractability of elliptic curve discrete logarithm problem.
基于有限域上离散对数问题提出了一种动态多秘密分享方案。
Based on the computational difficulty in computing discrete logarithms, this paper proposes a dynamic multiple secrets sharing scheme.
该方案的安全性取决于求解因子分解问题与离散对数问题的计算难度。
The scheme's security is based on the computing difficulty of solving the Factorization Problem and the Discrete Logarithm Problem.
基于单向函数和有限域上离散对数问题提出一种动态多秘密分享方案。
Based on the computational difficulty of computing discrete logarithms, a dynamic multiple secrets sharing scheme is proposed.
新协议的安全性基于椭圆曲线离散对数问题，服务器并不需要完全可信。
The security of the new protocol was based on the discrete logarithm on elliptic curve, and the server did not need to be completely trusted.
基于离散对数问题和单向函数的安全性，提出了一个新的安全的代理签名方案。
This paper proposed a secure proxy signature scheme based on the security of logarithmic problem and one-way function.
现有的代理数字签名方案大多是基于离散对数问题和大数因子分解问题的方案。
Up to now most of the known proxy digital signature schemes are based on discrete logarithmic problems or big number factorization problems.
将智能卡技术引入认证加密体制中，提出了一种基于离散对数问题的认证加密方案。
Smart card is integrated into authenticated encryption scheme, a new cryptographic scheme based on the discrete logarithm problem is presented.
摘要：现有的代理数字签名方案都是基于离散对数问题和大数因子分解问题的方案。
Absrtact: The present representative digital signature approaches are based on discrete logarithm problem and large number factor decomposition.
传统的基于有限域的离散对数问题因为可以使用指标计算方法而存在亚指数时间算法求解。
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.
本文设计了两种具有消息恢复的数字签名方案，其安全性都是基于因子分解问题和离散对数问题的。
In this paper, two schemes for digital signature with message recovery are presented. The security of these schemes is based on factorization and discrete logarithms.
目前的门限代理签名方案几乎都是基于离散对数问题的，基于RSA密码体制的门限代理签名方案几乎很少。
The proposed threshold proxy signature schemes have been based on the discrete logarithm problem, and there are few RSA-based schemes.
基于中国剩余定理，零知识证明与有限域上计算离散对数问题的困难性，提出了一种新的动态多秘密分享方案。
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.
协议的安全性是建立在目前尚未存在有效攻击方法的有限域上非超奇异椭圆曲线的椭圆曲线离散对数问题之上的。
The safety of this protocol is based on the elliptic curve discrete logarithm of non-supersingular elliptic curve over finite field, on which there has been no efficient attack method up to now.
该文描述了代数几何与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.
基于离散对数问题，提出了一个具有消息恢复的指定接收者的盲签名方案，并对方案的安全性和效率性进行了详细的分析讨论。
A new designated verifier blind signature scheme with message recovery based on the discrete logarithm problem is proposed, and its security and efficiency are analyzed and discussed in details.
基于椭圆曲线离散对数问题，纪家慧和李大兴提出了一个代理签名方案和一个代理多签名方案，陈泽雄等人给出了另外两个代理多签名方案。
Based on the elliptic curve discrete logarithm problem, Ji and Li proposed a proxy signature scheme and a proxy multi-signature scheme and Chen et al. proposed two proxy multi-signature schemes.
超椭圆曲线密码体制是以超椭圆曲线离散对数问题的难解性为基础的，具有安全性高、操作数短等优点，相对于其他密码体制有明显的优势。
The hyperelliptic curve cryptosystem is based on the hyperelliptic curve discrete logarithm problem, and has the higher safety and the shorter operands compared to other cryptosystems.
代理签名体制在电子商务中的应用很广泛，目前的代理签名体制安全性主要是基于求解大数因子分解问题的困难性或求解离散对数问题的困难性。
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.
代理签名体制在电子商务中的应用很广泛，目前的代理签名体制安全性主要是基于求解大数因子分解问题的困难性或求解离散对数问题的困难性。
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.
应用推荐