Approximating integer lattices by lattices with cyclic factor groups

  • A. Paz
  • C. P. Schnorr
Algorithms And Complexity
Part of the Lecture Notes in Computer Science book series (LNCS, volume 267)


We reduce in polynomial time various computational problems concerning integer lattices to the case that the lattice L is defined by a single modular (linear, homogeneous) equation, L = {x∈ℤn : 〈x,v〉=0 mod d} where v is a vector in ℤn and d an integer. An integer lattice L ⊂ ℤn can be written in this form if and only if L has rank n and if the abelian group ℤn/L is cyclic. The shortest vector problem, the problem to compute the successive minima of a lattice and the problem to reduce (in the sense of Minkowski or in the sense of Korkine, Zolotareff) a lattice basis is transformed in polynomial time to lattices of the above special form. Our method shows that every integer lattice can be approximated efficiently by rational lattices L ⊂ 1/k ℤn such that the abelian group ℤn/kL is cyclic.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    P.D. DOMICH, R. KANNAN and L.E. TROTTER, Jr.: Hermite normal form computation using modulo determinant arithmetic. CORE discussion paper No. 8507, Université catholique de Louvain (1985).Google Scholar
  2. [2]
    P. van EMDE BOAS: Another NP-complete partition problem and the complexity of computing short vectors in a lattice. Math. Dept. Report 81-O4, Univ. Amsterdam, April 1981.Google Scholar
  3. [3]
    M. KAMINSKI and A. PAZ: Computing the Hermite normal form of an integral matrix. Technical report # 417, Technion, Department of Computer Science, (1986).Google Scholar
  4. [4]
    R. KANNAN: Improved algorithms on integer programming and related lattice problems. Proc. 15th Annual ACM Symp. on Theory of Computing (1983), 193–206.Google Scholar
  5. [5]
    R. KANNAN and A. BACHEM: Polynomial algorithms for computing the Smith and Hermite normal forms of an integer matrix. Siam Journal of Computing 9, (1979), 499–507.Google Scholar
  6. [6]
    A. KORKINE and G. ZOLOTAREFF: Sur les formes quadratiques Math. Ann. 6 (1873), 366–389.Google Scholar
  7. [7]
    J.C. LAGARIAS, H.W. LENSTRA, Jr. and C.P. SCHNORR: Korkine-Zolotarev bases and successive minima of a lattice and its reciprocal, (1986). Submitted for publication.Google Scholar
  8. [8]
    A.K. LENSTRA, H.W. LENSTRA, Jr. and L. LOVÁSZ: Factoring polynomials with rational coefficients. Mathematische Annalen 261 (1982), 513–534.Google Scholar
  9. [9]
    H.W. LENSTRA, Jr.: Integer programming in a fixed number of variables. Math. Op. Res. 8 (1983), 538–548.Google Scholar
  10. [10]
    C.P. SCHNORR: A hierarchy of polynomial time lattice bases reduction algorithms (1986). To appear in Theoretical Computer Science.Google Scholar
  11. [11]
    C.P. SCHNORR: A more efficient algorithm for lattice basis reduction. To appear in Journal of Algorithms. Preprint in Lecture Notes in Computer Sciences, 226, (1986) 359–369.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • A. Paz
    • 1
  • C. P. Schnorr
    • 2
  1. 1.Computer Science Department TechnionHaifaIsrael
  2. 2.Fachbereich Mathematik/InformatikUniversität FrankfurtFrankfurtGermany

Personalised recommendations