How to Calculate Shortest Vectors in a Lattice
- 1 July 1975
- journal article
- Published by JSTOR in Mathematics of Computation
- Vol. 29 (131) , 827-833
- https://doi.org/10.2307/2005293
Abstract
A method for calculating vectors of smallest norm in a given lattice is outlined. The norm is defined by means of a convex, compact, and symmetric subset of the given space. The main tool is the systematic use of the dual lattice. The method generalizes an algorithm presented by Coveyou and MacPherson, and improved by Knuth, for the determination of vectors of smallest Euclidean norm.Keywords
This publication has 3 references indexed in Scilit:
- The Art of Computer Programming. Vol. II: Seminumerical AlgorithmsMathematics of Computation, 1970
- RANDOM NUMBERS FALL MAINLY IN THE PLANESProceedings of the National Academy of Sciences, 1968
- Fourier Analysis of Uniform Random Number GeneratorsJournal of the ACM, 1967