1. Generating hard instances of lattice problems;Ajtai,1996
2. The shortest vector problem in L2 is NP-hard for randomized reductions;Ajtai;Electronic Colloquium on Computational Complexity,1997
3. A public-key cryptosystem with worst-case/average-case equivalence;Ajtai,1997
4. The hardness of approximate optima in lattices, codes, and systems of linear equations;Arora,1993
5. An improved worst-case to average-case connection for lattice problems;Cai,1997