...欲从椭圆曲线基点G与x․G (或y․G)寻找到x (或y)是很困难 的，这就是所谓的椭圆曲线离散对数(elliptic-curve discrete logarithm)问题，其困难度与RSA的大数分解类似 ECDH如同Diffie-Hellman公开金钥交换演算法，本身无法 抵挡恶意攻击者在通信中间进行的主动...
基于6个网页-相关网页
elliptic curve discrete logarithm problem 椭圆曲线离散对数问题 ; 离散对数问题 ; 散对数问题 ; 离散对数难题
elliptic curve discrete logarithm problems 椭圆曲线离散对数问题
Elliptic Curve Discrete logarithm algorithm 椭圆曲线离散对数算法
All of their security is based on elliptic curve discrete logarithm problem.
它们的安全性都是基于椭圆曲线离散对数问题。
Both of their security are based on the intractability of elliptic curve discrete logarithm problem.
两种方案的安全性都是基于椭圆曲线离散对数问题的难解性。
The safety of this protocol is based on the elliptic curve discrete logarithm of non-supersingular elliptic curve over finite field, on which there has been no efficient attack method up to now.
协议的安全性是建立在目前尚未存在有效攻击方法的有限域上非超奇异椭圆曲线的椭圆曲线离散对数问题之上的。
应用推荐