搜索结果: 1-1 共查到“密码学 equivalent hard problems”相关记录1条 . 查询时间(0.061 秒)
The elliptic curve discrete logarithm problem and equivalent hard problems for elliptic divisibility sequences
elliptic curve discrete logarithm problem equivalent hard problems elliptic divisibility sequences
2009/6/3
We define three hard problems in the theory of elliptic divisibility
sequences (EDS Association, EDS Residue and EDS Discrete
Log), each of which is solvable in sub-exponential time if and only if t...