此外，本方案没有使用陷门离散对数。
Moreover, this scheme does not use the discrete logarithm with trapdoors.
基于离散对数给出了一种组签字方案。
Based on the discrete logarithm, this paper proposes a group signature schemes.
有时也把椭圆曲线类归为离散对数类。
Sometimes, the elliptic curve problem is also included into the discrete logarithm problem.
此外，本方案没有使用陷门离散对数。
方案的安全是基于解离散对数为困难问题。
The safety of this scheme is based on the intractable problem of solving Discrete Logarithm.
一种方案的安全性证明是基于离散对数问题；
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.
给出了一个新的基于离散对数的公钥追踪体制。
This paper proposed a new discrete logarithm based public key traitor tracing scheme.
该方案在离散对数问题和随机预言模型假设下是安全的。
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 is efficient and practical, and its security is based on the difficulty of computing ellipse curve discrete logarithms problem.
该方案的安全性取决于求解因子分解问题与离散对数问题的计算难度。
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.
现有的代理数字签名方案大多是基于离散对数问题和大数因子分解问题的方案。
Up to now most of the known proxy digital signature schemes are based on discrete logarithmic problems or big number factorization problems.
基于离散对数问题和单向函数的安全性，提出了一个新的安全的代理签名方案。
This paper proposed a secure proxy signature scheme based on the security of logarithmic problem and one-way function.
将智能卡技术引入认证加密体制中，提出了一种基于离散对数问题的认证加密方案。
Smart card is integrated into authenticated encryption scheme, a new cryptographic scheme based on the discrete logarithm problem is presented.
第二种方法就是运用离散对数的概念。要掌握这些概念首先需要了解乘法群的概念。
The second approach is to use the concept of discrete logarithm. Understanding this concept requires understanding some properties of multiplicative groups.
摘要：现有的代理数字签名方案都是基于离散对数问题和大数因子分解问题的方案。
Absrtact: The present representative digital signature approaches are based on discrete logarithm problem and large number factor decomposition.
利用广义可验证秘密分享，提出了基于离散对数的公钥体制的密钥的分布式生成协议。
A distributed key generation protocol for public key cryptosystem based on discrete-log is proposed using generalized verifiable secret sharing.
作者就此诸多问题，基于离散对数这一数学难题，提出了一种安全的多级代理签名方案。
To solve all these problems, a more secure multiple grade proxy signature scheme is proposed in this paper based on the study of a difficult mathematical concept, the discrete logarithm.
在本论文中，我们证明了假如离散对数的问题解决了，何的数位签章演算法是不安全的。
In this paper, we show that he's digital signature scheme is insecure against forgery if the discrete logarithms problem is solved.
协议二没有采用NAXOS方法，即使用户临时公钥的离散对数泄漏，协议仍是安全的。
Protocol II, without using the NAXOS trick, is still secure even if the exponent of an ephemeral public key is leaked.
传统的基于有限域的离散对数问题因为可以使用指标计算方法而存在亚指数时间算法求解。
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 results of comparison prove that this new digital signature based on discrete logarithm is more effective and secure than the others.
本文设计了两种具有消息恢复的数字签名方案，其安全性都是基于因子分解问题和离散对数问题的。
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.
与基于离散对数的方案相比，本方案用户端和网络中心的计算量与存储量少，能高效实现连续请求。
Compared with the scheme based on DLP, the scheme reduces the computation and storage both in the user ends and the net center, which makes sequential requests more efficient.
本文利用椭圆曲线上离散对数难解问题，提出了一种新的密钥认证方案，密钥由用户口令和秘密密钥组成。
A new key authentication scheme was proposed. This new scheme is based on the intractability of elliptic discrete logarithms. The key is combination of password and private key.
本文利用椭圆曲线上离散对数难解问题，提出了一种新的密钥认证方案，密钥由用户口令和秘密密钥组成。
A new key authentication scheme was proposed. This new scheme is based on the intractability of elliptic discrete logarithms. The key is combination of password and private key.
应用推荐