Lattice Reduction, Integer Programming, and Knapsacks
نویسنده
چکیده
We will discuss knapsack problems that arise in certain computa− tional number theory settings. A common theme is that the search space for the standard real relaxation is large; in a sense this trans− lates to a poor choice of variables. Lattice reduction methods have been developed in the past few years to improve handling of such problems. We show explicitly how they may be applied to computa− tion of Frobenius instances, Keith numbers (also called "repfigits"), and as a first step in computation of Frobenius numbers.
منابع مشابه
Cover and Pack Inequalities for (Mixed) Integer Programming
We review strong inequalities for fundamental knapsack relaxations of (mixed) integer programs. These relaxations are the 0–1 knapsack set, the mixed 0–1 knapsack set, the integer knapsack set, and the mixed integer knapsack set. Our aim is to give a common presentation of the inequalities based on covers and packs and highlight the connections among them. The focus of the paper is on recent re...
متن کاملLLL-reduction for integer knapsacks
Given a matrix A ∈ Zm×n satisfying certain regularity assumptions, a wellknown integer programming problem asks to find an integer point in the associated knapsack polytope P(A,b)= {x ∈R≥0 :Ax = b} or determine that no such point exists. We obtain an LLL-based polynomial time algorithm that solves the problem subject to a constraint on the location of the vector b.
متن کاملAdapting Density Attacks to Low-Weight Knapsacks
Cryptosystems based on the knapsack problem were among the first public-key systems to be invented. Their high encryption/ decryption rate attracted considerable interest until it was noticed that the underlying knapsacks often had a low density, which made them vulnerable to lattice attacks, both in theory and practice. To prevent low-density attacks, several designers found a subtle way to in...
متن کاملSolving Subset Sum Problems of Densioty close to 1 by "randomized" BKZ-reduction
Subset sum or Knapsack problems of dimension n are known to be hardest for knapsacks of density close to 1. These problems are NP-hard for arbitrary n. One can solve such problems either by lattice basis reduction or by optimized birthday algorithms. Recently Becker, Coron, Joux [BCJ10] present a birthday algorithm that follows Schroeppel, Shamir [SS81], and HowgraveGraham, Joux [HJ10]. This al...
متن کاملA new generic algorithm for hard knapsacks (preprint)
In this paper, we study the complexity of solving hard knapsack problems, especially knapsacks with a density close to 1 where lattice based low density attacks are not an option. For such knapsacks, the current state-of-the-art is a 28-year old algorithm by Shamir and Schroeppel which is based on birthday paradox techniques and yields a running time of Õ(2) for knapsacks of n elements and uses...
متن کامل