您要查找的是不是:
- discrele logarithm problem 离散对数问题
- 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. 给出了一种新的离散对数有序多重数字签名方案。
- ECC is set up on the basis of solving this mathematics difficult problem of the Elliptic Curve Discrete Logarithm Problem (ECDLP). 椭圆曲线密码体制(ECC)建立在解椭圆曲线离散对数问题(ECDLP)这一数学难题的基础上。
- 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. 摘要提出一种基于椭圆曲线离散对数问题的代理签名方案。
- 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 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). 在可验证方案中,基于离散对数问题,各参与者可以检验属于自己份额的共享的正确性。
- The digital signature protocols based on discrete logarithm problem come mainly from the transmutation of signature equation. 基于离散对数问题的数字签名系统使用的签名协议主要来自于签名等式的不同变形。
- The security of the scheme is set up on the intricate nature of the elliptic curve discrete logarithm problem and the knapsack problem. 方案的安全性建立在椭圆曲线离散对数问题和变形的背包问题的难解性上。
- The computational intractability of the Elliptic Curve Discrete Logarithm Problem (ECDLP) over a finite field enhances security of the scheme. 利用有限域上椭圆曲线点群中的离散对数问题的难解性来增强协议的安全性。
- This paper presents a new designated verifier proxy blind signature scheme with message recovery based on the discrete logarithm problem. 摘要 基于离散对数问题,提出了一种具备消息恢复且只有指定的验证者才能验证签名的代理盲签名方案。
- Under the condition of discrete logarithm problem, S2 was decrypted by OPE (Oblivious Polynomial Evaluation) protocol and Lagrange Interpolation Polynomial (scheme 2). 在离散对数困难问题的条件下,利用不经意多项式估值协议(OPE)和拉格朗日插值多项式来解密S2(方案2)。
- Under the condition of a discrete logarithm problem, S2 is decrypted by the OPE (Oblivious Polynomial Evaluation) protocol and Lagrange Interpolation Polynomial (scheme 2). 在离散对数困难问题的条件下,利用不经意多项式估值协议和拉格朗日插值多项式来解密S2(方案2)。
- Under the condition of a discrete logarithm problem,S2 is decrypted by the OPE(Oblivious Polynomial Evaluation) protocol and Lagrange Interpolation Polynomial(scheme 2). 在离散对数困难问题的条件下;利用不经意多项式估值协议和拉格朗日插值多项式来解密S2(方案2).
- Geometric approaches were used instead of public-key technologies such as disperse logarithm problem to form and exchange the messages in password authentication protocol. 口令认证协议中消息的形成与交换,采用几何方法代替基于离散对数难题等公钥技术。