1. 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/
2. 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
3. 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.
4. 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.
5. O. Goldreich, S. Goldwasser, S. Halevi, Collision-free hashing from lattice problems, Electronic Colloquium, on Computational Complexity, 1996, http://www.eccc.unitrier.de/eccc/