LATTICE BASIS REDUCTION - IMPROVED PRACTICAL ALGORITHMS AND SOLVING SUBSET SUM PROBLEMS

We report on improved practical algorithms for lattice basis reduction. We propose a practical floating point version of the L(3)-algorithm of Lenstra, Lenstra, Lovasz (1982). We present a variant of the L(3)-algorithm with ''deep insertions'' and a practical algorithm for block Korkin-Zolotarev reduction, a concept introduced by Schnorr (1987). Empirical tests show that the strongest of these algorithms solves almost all subset sum problems with up to 66 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 SPARC1+ computer.