Date: 09 Jun 2005

Lattice basis reduction: Improved practical algorithms and solving subset sum problems

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We report on improved practical algorithms for lattice basis reduction. We present a variant of the L 3-algorithm with “deep insertions” and a practical algorithm for blockwise Korkine-Zolotarev reduction, a concept extending L 3-reduction, that has been introduced by Schnorr (1987). Empirical tests show that the strongest of these algorithms solves almost all subset sum problems with up to 58 random weights of arbitrary bit length within at most a few hours on a UNISYS 6000/70 or within a couple of minutes on a SPARC 2 computer.