Learn More
We generalize the concept of block reduction for lattice bases from the l 2 {norm to arbitrary norms. This extends the results of Schnorr S87, S94]. We give algorithms for block reduction and apply the resulting enumeration concept to solve subset sum problems. The deterministic algorithm solves all subset sum problems. For up to 66 weights it needs in(More)
We propose a fast variant of the Gaussian algorithm for the reduction of two{ dimensional lattices for the l 1 ?; l 2 ? and l 1 ?norm. The algorithm runs in at most O(n M(B) log B) bit operations for the l 1 ?norm and in O(n logn M(B) log B) bit operations for the l 1 ? and l 2 ?norm on input vectors a; b 2 Z Z n with norm at most 2 B where M(B) is a time(More)
  • 1