In this paper, we show that he's digital signature scheme is insecure against forgery if the discrete logarithms problem is solved.
在本论文中，我们证明了假如离散对数的问题解决了，何的数位签章演算法是不安全的。
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.
在用户层次结构的动态存取控制问题上，本文提出了一种安全有效的方案。
应用推荐