scientific article; zbMATH DE number 4132270

From MaRDI portal
Publication:3033846





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.











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033846)