Based on the computational difficulty of computing discrete logarithms, a dynamic multiple secrets sharing scheme is proposed.
基于单向函数和有限域上离散对数问题提出一种动态多秘密分享方案。
In this paper, we show that he's digital signature scheme is insecure against forgery if the discrete logarithms problem is solved.
在本论文中，我们证明了假如离散对数的问题解决了，何的数位签章演算法是不安全的。
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.
方案的安全性基于求解有限域上椭圆曲线离散对数的困难性。
In the problem of dynamic access control, we present a secure and efficient scheme, which is based on discrete logarithms and polynomial interpolation.
在用户层次结构的动态存取控制问题上，本文提出了一种安全有效的方案。
In this paper, we present a new signature scheme with message recovery and the security of the scheme is based on both factorization and discrete logarithms.
本文设计一种新的具备消息自动恢复特性的数字签名方案，这种方案的安全性同时建立在因子分解和离散对数之上，并对这种方案进行了安全性分析。
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.
本文设计了两种具有消息恢复的数字签名方案，其安全性都是基于因子分解问题和离散对数问题的。
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.
基于中国剩余定理，零知识证明与有限域上计算离散对数问题的困难性，提出了一种新的动态多秘密分享方案。
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.
本文利用椭圆曲线上离散对数难解问题，提出了一种新的密钥认证方案，密钥由用户口令和秘密密钥组成。
应用推荐