M. Ajtai, Generating Hard Instances of the Short Basis Problem, ICALP, pp.1-9, 1999.
DOI : 10.1007/3-540-48523-6_1

M. Ajtai, Generating hard instances of lattice problems Preliminary version in STOC, pp.1-32, 1996.

O. Goldreich, S. Goldwasser, and S. Halevi, Collision-Free Hashing from Lattice Problems, Electronic Colloquium on Computational Complexity (ECCC), vol.9, issue.4, 1996.
DOI : 10.1016/0196-6774(88)90004-1
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.286

O. Goldreich, S. Goldwasser, and S. Halevi, Public-key cryptosystems from lattice reduction problems, CRYPTO, pp.112-131, 1997.
DOI : 10.1007/BFb0052231
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.2377

[. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.197-206, 2008.
DOI : 10.1145/1374376.1374407
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.63.7052

J. Håstad, R. Impagliazzo, L. A. Levin, and M. Luby, A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, vol.28, issue.4, pp.1364-1396, 1999.
DOI : 10.1137/S0097539793244708

D. Micciancio, Improving Lattice Based Cryptosystems Using the Hermite Normal Form, CaLC, pp.126-145, 2001.
DOI : 10.1007/3-540-44670-2_11

D. Micciancio and O. Regev, Worst???Case to Average???Case Reductions Based on Gaussian Measures, SIAM Journal on Computing, vol.37, issue.1, pp.267-302, 2004.
DOI : 10.1137/S0097539705447360

D. Micciancio and S. P. Vadhan, Statistical Zero-Knowledge Proofs with Efficient Provers: Lattice Problems and More, CRYPTO, pp.282-298, 2003.
DOI : 10.1007/978-3-540-45146-4_17

D. Micciancio and B. Warinschi, A linear space algorithm for computing the hermite normal form, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.231-236, 2001.
DOI : 10.1145/384101.384133

Q. Phong and . Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi cryptosystem from Crypto '97, CRYPTO, pp.288-304, 1999.

Q. Phong, O. Nguyen, and . Regev, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, EUROCRYPT, pp.271-288, 2006.

C. Peikert, Public key cryptosystems from the worst-case shortest vector problem In submission [PV08] Chris Peikert and Vinod Vaikuntanathan. Noninteractive statistical zero-knowledge proofs for lattice problems, CRYPTO, pp.536-553, 2008.

C. Peikert, V. Vaikuntanathan, and B. Waters, A Framework for Efficient and Composable Oblivious Transfer, CRYPTO, pp.554-571, 2008.
DOI : 10.1007/978-3-540-85174-5_31

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, STOC, pp.84-93, 2005.
DOI : 10.1145/1060590.1060603
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.5202