搜索结果: 1-1 共查到“军事学 First fall degree assumption”相关记录1条 . 查询时间(0.228 秒)
Complexity of ECDLP under the First Fall Degree Assumption
ECDLP First fall degree assumption polynomial time algorithm
2015/12/22
Semaev [14] shows that under the first fall degree assumption, the complexity
of ECDLP over F2n , where n is the input size, is O(2n
1/2+o(1) ). In his manuscript,
the cost for solving equations sy...