On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications

Abstract

The problem of determining shortest vectors and reduced bases or successive minima of lattices often occurs in algebra and number theory. Nevertheless, computational methods for the solution hardly exist in the literature. It is the aim of this paper to develop efficient algorithms for this purpose.