An algorithm to construct Minkowski-reduced lattice-bases

  • Bettina Helfrich
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 182)


This paper presents an algorithm M-RED, which constructs Minkowski-reduced bases for lattices of arbitrary dimension n. For n fixed, the running time is polynomial in the length of the input.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [CAS]
    J.W.S.Cassels, "An Introduction to the Geometry of Numbers", Heidelberg 1959Google Scholar
  2. [HEL]
    B. Helfrich, "Reduktionsalgorithmen für Gitterbasen", Diplomarbeit, Frankfurt 1984Google Scholar
  3. [KAN]
    R.Kannan, "Improved Algorithms for Integer Programming and Related Lattice Problems", in 15th ACM Symposium on Theory of Computing, 1983Google Scholar
  4. [LAG]
    J.C.Lagarias, "Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms", in Journal of Algorithms, 1980Google Scholar
  5. [LLL]
    A.K.Lenstra, H.W.Lenstra, L.Lovàsz, "Factoring Polynomials with Rational Coefficients", Report 82-05, Mathematisch Instituut, Universiteit Amsterdam, 1982Google Scholar
  6. [WAE]
    B.L. van der Waerden, H.Gross, "Studien zur Theorie der Quadratischen Formen", Basel 1968.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1984

Authors and Affiliations

  • Bettina Helfrich
    • 1
  1. 1.Fachbereich Mathematik der J.W.Goethe-UniversitätFrankfurt/Main

Personalised recommendations