Advertisement

On the complexity of finding short vectors in integer lattices

  • Erich Kaltofen
Alsorithms 4 — Factorization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 162)

Abstract

In [Lenstra, A., et al. 82] an algorithm is presented which, given n linearly independent n-dimensional integer vectors, calculates a vector in the integer lattice spanned by these vectors whose Euclidean length is within a factor of 2(n−1)/2 of the length of the shortest vector in this lattice. If B denotes the maximum length of the basis vectors, the algorithm is shown to run in O(n6(log B)3) binary steps. We prove that this algorithm can actually be executed in O(n6(log B)2+n5(log B)3) binary steps by analyzing a modified version of the algorithm which also performs better in practice.

Keywords

Binary Complexity Integer Lattice Integer Multiplication Euclidean Length Short Vector 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Gantmacher 59]
    Gantmacher, F. R.: Matrix Theory, vol. 1. New York: Chelsea 1959.Google Scholar
  2. [Kaltofen 82]
    Kaltofen, E.: A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization. Proc. 23rd Symp. Foundations of Comp. Sci., IEEE 57–64 (1982).Google Scholar
  3. [Knuth 81]
    Knuth, D. E.: The Art of Computer Programming, vol.2, Seminumerical Algorithms, 2nd ed. Reading, MA: Addison Wesley 1981.Google Scholar
  4. [Lagarias 82]
    Lagarias, J.C.: The Computational Complexity of Simultaneous Diophantine Approximation Problems. Proc. 23rd Symp. Foundations of Comp. Sci., IEEE 32–39 (1982).Google Scholar
  5. [Lenstra, A., et al. 82]
    Lenstra, A. K., Lenstra, H. W., jr., Lovász, L.: Factoring Polynomials with Rational Coefficients. Report 82-05. Amsterdam: Mathematisch Instituut 1982.Google Scholar
  6. [Lenstra, H. 81]
    Lenstra, H.W., jr.: Integer Programming with a Fixed Number of Variables. Univ. Amsterdam: Math. Inst. Report 81-03, 1981.Google Scholar
  7. [Odlyzko 82]
    Odlyzko, A.M.: Private Communications 1982.Google Scholar
  8. [Schönhage and Strassen 71]
    Schönhage, A., and Strassen, V.: Schnelle Multiplication grosser Zahlen. Computing 7, 281–292 (1971).Google Scholar

Copyright information

© Springer-Verlag 1983

Authors and Affiliations

  • Erich Kaltofen
    • 1
  1. 1.Department of Computer ScienceUniversity of TorontoTorontoCanada

Personalised recommendations