On the Minimum Volume of a Perturbed Unit Cube

Authors:
Jin-yi Cai
Affiliations:
-
Venue:
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Year:
2002

Citing 3
Cited 0

Generating hard instances of lattice problems (extended abstract)

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some Recent Progress on the Complexity of Lattice Problems

COCO '99 Proceedings of the Fourteenth Annual IEEE Conference on Computational Complexity
An Improved Worst-Case to Average-Case Connection for Lattice Problems

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give exact bounds to the minimum volume of a paralelepiped whose spanning vectors are perturbations of the n unit vectors by vectors of length at most 驴. This extends Micciancio's recent sharp bounds to all possible values of 驴. We also completely determine all possible perturbations with length at most 驴 that achieve this minimum volume.