军事学 >>> 军事学
搜索结果: 1-7 共查到知识库 军事学 The Way We Fall相关记录7条 . 查询时间(0.093 秒)
The first fall degree assumption provides a complexity approximation of Gr¨obner basis algorithms when the degree of regularity of a polynomial system cannot be precisely evaluated. Most importantly,...
Higher-order side-channel attacks are able to break the security of cryptographic implementations even if they are protected with masking countermeasures. In this paper, we derive the best possible ...
Weil descent methods have recently been applied to attack the Hidden Field Equation (HFE) public key systems and solve the elliptic curve discrete logarithm problem (ECDLP) in small characteristic. ...
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...
Recently, there are many researches [5] [3] [7] [4] that, under the first fall degree assumption, the complexity of ECDLP over Fpn where p is small prime and the extension degree n is input size, is...
We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev’s summation polynomials.
We show that if there exist indistinguishability obfuscators for all circuits then there do not exist auxiliary-input extractable one-way functions. In particular, the knowledge of exponent assumption...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...