搜索结果: 1-3 共查到“军队指挥学 generic algorithms”相关记录3条 . 查询时间(0.062 秒)
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time O(2^0.337n) and memory O(2^0.256n), thereby improving a 30-year old algorith...
An r-collision for a function is a set of r distinct inputs with identical outputs.
Actually finding r-collisions for a random map over a finite set of cardinality N requires
at least about N(rh...
Sufficient Conditions for Computational Intractability Regarding Generic Algorithms
Generic Group Model Straight-Line Programs Hardness Conditions
2008/5/28
The generic group model is a valuable methodology for analyzing the computational hardness of the number-theoretic problems used in cryptography. Although generic hardness proofs exhibit many similari...