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

  • C. P. Schnorr
  • M. Euchner
Invited Lectures

DOI: 10.1007/3-540-54458-5_51

Part of the Lecture Notes in Computer Science book series (LNCS, volume 529)
Cite this paper as:
Schnorr C.P., Euchner M. (1991) Lattice basis reduction: Improved practical algorithms and solving subset sum problems. In: Budach L. (eds) Fundamentals of Computation Theory. FCT 1991. Lecture Notes in Computer Science, vol 529. Springer, Berlin, Heidelberg

Abstract

We report on improved practical algorithms for lattice basis reduction. We present a variant of the L3-algorithm with “deep insertions” and a practical algorithm for blockwise Korkine-Zolotarev reduction, a concept extending L3-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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1991

Authors and Affiliations

  • C. P. Schnorr
    • 1
  • M. Euchner
    • 1
  1. 1.Fachbereich Mathematik/InformatikUniversität FrankfurtFrankfurt am MainGermany

Personalised recommendations