搜索结果: 1-1 共查到“军事学 NP-hard instances”相关记录1条 . 查询时间(0.109 秒)
Knapsack cryptosystems built on NP-hard instances
Knapsack cryptosystems NP-hard instances Probabilistic polynomial reductions
2009/6/3
We construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy
instances of the knapsack problem and have been broken. The systems considered in the article face
thi...