The general subset sum problem is NP-complete. However, there are two algorithms, one due to Brickell and the other to Lagarias and Odlyzko, which in polynomial time solve almost all subset sum problems of sufficiently low density. Both methods rely on bas
Table 1: Fraction of random subset sum problems solved by a particular reduction algorithm applied to bases L and L0, respectively 50 50 50 66 66 66 66 66 66 66 66
n
50 60 75 76 84 92 100 104 108 112 116
b
0.05 0.55 1.00{{{{ 0.30 0.55 0.60 1.00
L
1.00 1.00{ 0.25 0.80 0.95 1.
00 1.00 1.00 1.00{
L0
known algorithms for lattice basis reduction, applying them to lattice L0 instead of lattice L also yields dramatic improvements, although the results are not as good as they would be in the presence of a lattice oracle. For example, Table 1 presents the comparison obtained in one particular set of experiments. The lattices used were not exactly L and L0, and the reduction algorithm used a combination of ideas from several sources. More extensive data sets and details of the computations are presented in 12]. For each entry in Table 1, n denotes the number of items, and b the number of bits (chosen at random) for each item. For each (n; b) combination, 20 problems were attempted, where in each case ei= 1 for exactly n=2 of the items. The entries for the L and L0 column indicate what fraction of the 20 problems were solved in each case. It would be of interest to obtain similar comparisons for implementations of other algorithms, such as that of 10].
References 1] E. F. Brickell, Solving low density knapsacks. Advances in Cryptology, Proceedings of Crypto '83, Plenum Press, New York (1984), 25-37. 2] E. F. Brickell, The cryptanalysis of knapsack cryptosystems. Applications of
暂无评价 14页 免费 Improved low-density sub... 暂无评价 18页 免费搜...Branching proofs of infeasibility in low density subset sum problems G?bor ...
M. Odlyzko, “Solving low-density Subset Sum problems“, J. Assoc. Comp...Euchner M., “Lattice Basis Reduction: Improved Practical Algorithms and ...
M. Odlyzko, “Solving low-density Subset Sum problems“, J. Assoc. Comp...Euchner M., “Lattice Basis Reduction: Improved Practical Algorithms and ...
Improved low-density subset sum algorithms[J]. Computational Complexity,1992,2(2): 111-128. [11] 于志强, 罗世新, 徐树民等.对一个公钥密码体制的格...
subset_sum_problem_计算机软件及应用_IT/计算机_专业资料。CS 105: Algorithms (Grad) Subset Sum Problem Soumendra Nanda March 2, 2005 1 What is the Subset...
improved low ? density subset sum algorithms[j]. computational complexity, 1992, 2(2): 111-128. ?[3] odlyzko a m. the rise and fall of knapsack ...
Stern. Improved Low-density Subset Sum Algorithms. Computational Complexity, 2:111–128, 1992. CosterLaMacchiaOdlyzkoea:91 . . . . . . . . . . ....
7页 免费 Improved low-density sub... 暂无评价 14页 免费喜欢此文档的还喜欢...Subset-sum Problem- and other balanced knapsack algorithms An O(nr) algori...
Improved low-density sub... 暂无评价 14页 免费 Improved low-density sub....algorithm for the Subset-sum Problem and other balanced knapsack algorithms ...
Afterwards, similar problems turned up in -4- connection with an algorithm for solving low-density subset-sum problems [9], where a crucial role in ...
热门文档