No label defined (Q3033846)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 4132270
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 4132270

      Statements

      0 references
      1988
      0 references
      lattice reduction
      0 references
      computational number theory
      0 references
      Lenstra-Lenstra-Lovász algorithm
      0 references
      expository paper
      0 references
      reduced basis
      0 references
      complexity
      0 references
      bibliography
      0 references
      The central theme of this mainly expository paper is the description and application of the Lenstra-Lenstra-Lovász \((L^ 3)\) algorithm for finding a reduced basis of a lattice. The author first describes the general setting of the Geometry of Numbers and then goes on to discuss the \(L^ 3\)-algorithm and analyze its complexity. Certain modified versions of this algorithm are also mentioned. These are very simple to implement and permit calculations in lattices to be conducted with considerable ease. Applications of the \(L^ 3\) algorithm both to the theory of lattices and to areas outside the theory of lattices such as number theory, algebra, and cryptography are also discussed. A lengthy bibliography is provided.
      0 references

      Identifiers