搜索结果: 1-4 共查到“军队指挥学 birthday problem”相关记录4条 . 查询时间(0.062 秒)
An Algorithmic Framework for the Generalized Birthday Problem
Algorithmic Framework Generalized Birthday Problem
font style='font-size:12px;'>
2018/6/7
Our results are obtained using a framework that combines several algorithmic techniques such as variants of the Schroeppel-Shamir algorithm for solving knapsack problems (devised in works by Howgrave-...
Refinements of the k-tree Algorithm for the Generalized Birthday Problem
Generalized birthday problem k-list problem k-tree algorithm
font style='font-size:12px;'>
2016/3/23
We study two open problems proposed by Wagner in his seminal work on the generalized birthday problem. First, with the use of multicollisions, we improve Wagner's 3-tree algorithm. The new 3-tree only...
Asymmetric proof-of-work based on the Generalized Birthday problem
Bitcoin memory-hard asymmetric proof-of-work
font style='font-size:12px;'>
2015/12/22
The proof-of-work is a central concept in modern cryptocurrencies, but the requirement for fast verification so far made it an easy prey for GPU-, ASIC-, and botnet-equipped users. The attempts to rel...
A non-uniform birthday problem with applications to discrete logarithms
birthday paradox discrete logarithm problem (DLP) probabilistic analysis of randomised algorithms
font style='font-size:12px;'>
2010/12/9
We consider a generalisation of the birthday problem which arises in the analysis of algorithms for certain variants of the discrete logarithm problem in groups. More precisely, we consider sampling c...