Abstract
A class of random lattices is given, in [1] so that (a) a random lattice can be generated in polynomial time together with a short vector in it, and (b) assuming that certain worst-case lattice problems have no polynomial time solutions, there is no polynomial time algorithm which finds a short vector in a random lattice with a polynomially large probability. In this paper we show that lattices of the same random class can be generated not only together with a short vector in them, but also together with a short basis. The existence of a known short basis may make the construction more applicable for cryptographic protocols.
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, Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 1996, or Electronic Colloquium on Computational Complexity, 1996, http://www.eccc.uni-trier.de/eccc/
M. Ajtai and C. Dwork, A Public-Key Cryptosystem with Worst-Case/Average-Case Equivalence, Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, or
J-Y Cai, Some Recent Progress on the Complexity of Lattice Problems, Electronic Colloquium on Computational Complexity, 1999, http://www.eccc.uni-trier.de/eccc/, to appear in the Proceedings of the IEEE Conference of Computational Complexity, 1999.
J-Y Cai, A. Nerurkar. An Improved Worst-Case to Average-Case Connection for Lattice Problems. In Proc. 38th IEEE Symposium on Foundations of Computer Science, 1997, 468–477.
O. Goldreich, S. Goldwasser, S. Halevi, Collision-free hashing from lattice problems, Electronic Colloquium, on Computational Complexity, 1996, http://www.eccc.unitrier.de/eccc/
O. Goldreich, S. Goldwasser, S. Halevi, Public-key cryptosystems from lattice reduction problems, In Advances in Cryptology-Crypto’97, Burton S. Kaliski Jr. (Ed.), Lecture Notes in Computer Science, 1294:112–131, Springer-Verlag, 1997.
O. Goldreich, S. Goldwasser, S. Halevi, Eliminating decryption errors in the Ajtai-Dwork cryptosystem, In Advances in Cryptology-Crypto’97, Burton S. Kaliski Jr. (Ed.), Lecture Notes in Computer Science, 1294:105–111, Springer-Verlag, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ajtai, M. (1999). Generating Hard Instances of the Short Basis Problem. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds) Automata, Languages and Programming. Lecture Notes in Computer Science, vol 1644. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48523-6_1
Download citation
DOI: https://doi.org/10.1007/3-540-48523-6_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66224-2
Online ISBN: 978-3-540-48523-0
eBook Packages: Springer Book Archive