您要查找的是不是：
- The other is based on discrete logarithm problem(DLP), like DSA. 另一类是基于离散对数问题的，如DSA数字签名体制。
- A new sequential multisignature scheme based on discrete logarithm problem without the mentioned problem is proposed. 给出了一种新的离散对数有序多重数字签名方案。
- A new efficient directed signature scheme based on the composite discrete logarithm in domain was presented. 提出了一个基于复合离散对数的有向数字签名方案,其运算量、名的长度等效于离散对数的数字签名。
- ECC is set up on the basis of solving this mathematics difficult problem of the Elliptic Curve Discrete Logarithm Problem (ECDLP). 椭圆曲线密码体制(ECC)建立在解椭圆曲线离散对数问题(ECDLP)这一数学难题的基础上。
- The security of Elliptic Curve Cryptogrphy(ECC) is based on the difficulty of elliptic curve discrete logarithm. 椭圆曲线密码体制的安全性基于椭圆曲线离散对数问题的难解性。
- Both of their security are based on the intractability of elliptic curve discrete logarithm problem. 两种方案的安全性都是基于椭圆曲线离散对数问题的难解性。
- Under the condition of the discrete logarithm problem, S2 is decrypted by the Chinese Remainder Theorem (scheme 2). 在离散对数困难问题的条件下，利用中国剩余定理来解密S2（方案2）。
- Based on elliptic curve discrete logarithm problem A proxy signa ture scheme is proposed. 提出一个新的基于椭圆曲线离散对数问题的代理签名方案。
- A proxy signature scheme based on elliptic curve discrete logarithm problem is proposed. 摘要提出一种基于椭圆曲线离散对数问题的代理签名方案。
- This scheme is secure based on difficulties of discrete logarithm and resolving a big number. 方案在离散对数和大数分解计算困难下是安全的,并且满足代理签名的所有性质。
- Here,another scheme based on elliptic curve discrete logarithm problem(ECDLP)wasproposed. 传统的代理签名方案都是基于离散对数问题的。
- Sometimes, the elliptic curve problem is also included into the discrete logarithm problem. 有时也把椭圆曲线类归为离散对数类.
- In this paper, we mainly study signatures of knowledge of discrete logarithm with coefficient. 本文主要研究了带有系数的离散对数知识签名。
- The elliptic curvedigital signature is the elliptic curveanalogue of digital signature based on discrete logarithm of multiplicative group. 椭圆曲线数字签名实际上是基于乘法群的离散对数问题的数字签名在椭圆曲线上的模拟。
- In the random oracle model, using forking lemma proposed byPointcheval and Stern, breaking of the scheme is equivalent to solve discrete logarithm problem. 在随机神谕模型下,通过Pointcheval和Stern提出的分叉引理,攻破该方案等价于解离散对数问题。
- In the verified scheme, the respective participants receiving the shares can verify their validity based on the discrete logarithm problem (DLP). 在可验证方案中，基于离散对数问题，各参与者可以检验属于自己份额的共享的正确性。
- We present a new scheme for authenticated key exchange,the security of which is based on both discrete logarithm and big integer factorization. 提出一种基于身份认证的密钥交换新方案,其安全性是同时基于离散对数和大整数分解难问题的。
- Furthermore, different from some traditional private mechanism, the cryptological technology is not limited in the discrete logarithm in our mechanism. 与传统的私密交易机制不同，我们的数字产品交易机制加密机制不仅仅是离散对数。
- Compared with classical group signature, the conic analog over Zn has strongly improved the security of computing discrete logarithm. 与经典群签名方案相比较，离散对数问题更加困难，有效提高了方案的安全性；
- To solve these two problems, a new multi-secret sharing scheme based on the intractability of the discrete logarithm was presented. 针对这两个问题，基于离散对数求解的困难性提出了一个新的门限多秘密共享方案。
