您要查找的是不是:
- 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. 给出了一种新的离散对数有序多重数字签名方案。
- In this paper a dynamic secret sharing scheme based on discrete logarithms was proposed and it can detect cheaters. 本文提出了一个基于对数的动态秘密分享方案,它能够检测欺诈者。
- This paper introduces a public key authentication scheme Based on discrete logarithms. 介绍了一种基于离散对数的公开赛钥认证方案,该方案不需要设立特权者来认证公开密钥。
- A new proxy multi-signature scheme with message recovery is proposed based on discrete logarithms. 摘要 基于离散对数提出了一个具有消息恢复的代理多重签名方案。
- Two new digital signature schemes whose security are based on both discrete logarithms and factorization are 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)。
- Its security depends not only on the elliptic curve discrete logarithms but also on the choice of the elliptic curve and its system. 其安全性不仅依赖于椭圆曲线离散对数的分解难度,而且依赖于椭圆曲线的选取和椭圆曲线密码体制。
- 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. 摘要提出一种基于椭圆曲线离散对数问题的代理签名方案。
- Its operating speed is faster, and its security is strictly based on the difficulties of discrete logarithms and factoring. 该方案签名步骤简捷,安全性严格基于因子分解和离散对数两大难题。
- 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. 椭圆曲线数字签名实际上是基于乘法群的离散对数问题的数字签名在椭圆曲线上的模拟。