Finding short vectors in a lattice of Voronoi's first kind

Abstract

We show that for those lattices of Voronoi's first kind, a vector of shortest nonzero Euclidean length can computed in polynomial time by computing a minimum cut in a graph.

arXiv commentsubmitted to the 2012 International Symposium on Information Theory (ISIT)

Cited by in corpus (1)

• New Shortest Lattice Vector Problems of Polynomial Complexity