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
P
bound by reducing a polynomial number of bases with di erent bn 1 vectors. However, for small dimensions it might be possible to improve the bound, even though any such advantage will disappear as n grows. In cases where the subset sum problem (Equation 1) to be solved is known to have ei small (as occurs in some knapsack cryptosystems, such as the Chor-Rivest one 4], which has still not been broken), it is possible to again improve on the results of 11] by our approach. For example, if we know that + X
n
we can replace the vector bn 1 in the basis of L by +
i=1
ei= n;
b00 1= (;;:::;; Ns); n +
and then the lattice L will contain a vector of length n (1? ), and our analysis shows that in this case it then becomes possible to solve most problems with even smaller weights ai. However, it appears that there are choices for parameters in the Chor-Rivest knapsack that would resist even this attack. When we consider the L1 or sup-norm, then we nd that the vector^0 has norm 1/2. Since there are at most 2n non-zero e 0 of norm 1=2, we can solve almost all subset sum problems of any vectors in L density< 1 if we have a lattice oracle for the sup-norm. Formally, we may make the following proposition: Proposition. Let A be a positive integer, and let a;:::; an be random integers with 0< ai A for 1 i n. Let e= (e;:::; en) 2 f0; 1gn be arbitrary, and let s= n eiai. If the density d< 1, then the subset sum problem de ned by a;:::; an i and s may\almost always" be solved in polynomial time, given the existence of a sup-norm lattice oracle. 1 P 1=1 1
q
k(x;:::; xn)k1= maxn jxj j; j 1 1
The general sup-norm shortest vector problem is known to be NP-complete 6]; the complexity of the square-norm shortest vector proble
m is an open problem. That a sup-norm lattice oracle yields a better density bound than a square-norm lattice oracle suggests that the shortest vector problem for the sup-norm might be harder than for the square-norm. Sections 3 and 4 presented theoretical results that assume the availability of an e cient method for nding the shortest non-zero vector in a lattice. When one uses
暂无评价 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 ...
热门文档