A Reverse Minkowski Theorem Page 1 A Reverse Minkowski Theorem Oded Regev ∗
Courant Institute, New York University New York, New York 10012, United States Noah …

In this work, we give a novel algorithm for computing dense lattice subspaces, a
conjecturally tight characterization of the lattice covering radius, and provide a bound on the …

In a seminal paper, Kannan and Lovász (1988) considered a quantity KL(Λ,K) which
denotes the best volume-based lower bound on the covering radius μ(Λ,K) of a convex body …

We present a natural reverse Minkowski-type inequality for lattices, which gives upper
bounds on the number of lattice points in a Euclidean ball in terms of sublattice …

Lattice-Width Directions and Minkowski's $3^d$-Theorem Page 1 Copyright © by SIAM.
Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2012 Society …

Lattices have received considerable attention as a potential source of computational
hardness to be used in cryptography, after a breakthrough result of Ajtai in Proceedings of …

We provide the first hardness result for the Covering Radius Problem on lattices (CRP).
Namely, we show that for any large enough p≤∞ there exists a constant cp> 1 such that …

On the Number of Convex Lattice Polygons Page 1 Combinatorics, Probability and
Computing (1992) 1, 295-302 Copyright © 1992 Cambridge University Press On the …

We prove that given a point\overline z outside a given lattice L then there is a dual vector
which gives a fairly good estimate for how far from the lattice the vector is. To be more …

We find the shortest non-zero vector in the lattice of all integer multiples of the vector (a, b)
modulo m, for given integers 0< a, b< m. We reduce the problem to the computation of a …