Abstract
We give exact bounds to the minimum volume of a parallelepiped 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
M. Ajtai. Generating hard instances of lattice problems. In Proc. 28th Annual ACM Symposium on the Theory of Computing, 1996. Full version available from ECCC, Electronic Colloquium on Computational Complexity TR96-007, at http://www.eccc.uni-trier.de/eccc/.
Jin-Yi Cai. Some Recent Progress on the Complexity of Lattice Problems. Plenary Talk. In the Proceedings of The 14th Annual IEEE Conference on Computational Complexity, 158–177, 1999.
J-Y. Cai and A. Nerurkar. An Improved Worst-Case to Average-Case Connection for Lattice Problems. In Proc. 38th IEEE Symposium on Foundations of Computer Science (FOCS), 1997, 468–477.
Daniele Micciancio. Minimal volume of almost cubic parallelepipeds. Manuscript. To appear.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cai, JY. (2002). On the Minimum Volume of a Perturbed Unit Cube. In: Bose, P., Morin, P. (eds) Algorithms and Computation. ISAAC 2002. Lecture Notes in Computer Science, vol 2518. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36136-7_7
Download citation
DOI: https://doi.org/10.1007/3-540-36136-7_7
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00142-3
Online ISBN: 978-3-540-36136-7
eBook Packages: Springer Book Archive