Skip to main content
SpringerLink
Log in

Computing a lattice basis from a system of generating vectors

  • Applications And Systems
  • Conference paper
  • First Online:
Eurocal '87 (EUROCAL 1987)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 378))

Included in the following conference series:

Abstract

In this paper we describe how the LLL-algorithm can be used to compute a basis of a lattice L in R n from a system of k generating vectors and a lower bound for the lengths of the non zero vectors in L. The algorithm which we present is proved to be polynomial time in n + k and the size of the input data. The algorithm is applied to the problem of finding multiplicative relations between units of algebraic number fields. Numerical results show that our method works very efficiently.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Buchmann, On the computation of units and class numbers by a generalization of Lagranges's algorithm, J. Number Theory 26 (1987), 8–30.

    Article  Google Scholar 

  2. J. Buchmann and D. Ford, On the computation of totally real fields of small discriminant, Math. Comp., to appear.

    Google Scholar 

  3. U. Fincke and M. Pohst, Improved methods for calculating vectors of short length, including a complexity analysis, Math. Comp. 44 (1985), 463–471.

    Google Scholar 

  4. J. Hastad, B. Just, J.C. Lagarias and C.P. Schnorr, Polynomial time algorithms for finding integer relations among real numbers, Proceedings STACS 86.

    Google Scholar 

  5. A.K. Lenstra, H.W. Lenstra Jr. and L. Lovasz, Factoring polynomials with rational coefficients, Math. Ann. 261 (1982), 515–534.

    Article  Google Scholar 

  6. M. Pohst, A modification of the LLL-algorithm, J. Symb. Comp. 4 (1987),123–127.

    Google Scholar 

  7. M. Pohst und H. Zassenhaus, Algorithmic algebraic number theory, Cambridge University Press, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematisches Institut, Universität Düsseldorf, 4000, Düsseldorf, FRG

    Johannes Buchmann & Michael Pohst

Authors
  1. Johannes Buchmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael Pohst
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

James H. Davenport

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Buchmann, J., Pohst, M. (1989). Computing a lattice basis from a system of generating vectors. In: Davenport, J.H. (eds) Eurocal '87. EUROCAL 1987. Lecture Notes in Computer Science, vol 378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51517-8_89

Download citation

  • DOI: https://doi.org/10.1007/3-540-51517-8_89

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51517-3

  • Online ISBN: 978-3-540-48207-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation