M. Ajtai, The shortest vector problem in L2 is NP-hard for randomized reductions (extended abstract), Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, pp.10-19, 1998.

L. Babai, On Lovász' lattice reduction and the nearest lattice point problem, Combinatorica, vol.6, issue.1, pp.1-13, 1986.

P. V. Boas, Another NP-complete problem and the complexity of computing short vectors in lattices, 1981.

Y. Chen and P. Q. Nguyen, BKZ 2.0: Better lattice security estimates, Advances in Cryptology -ASIACRYPT 2011: 17th International Conference on the Theory and Application of Cryptology and Information Security, vol.7073, pp.1-20, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01109961

L. Ducas, A. Durmus, T. Lepoint, and V. Lyubashevsky, Lattice signatures and bimodal gaussians, Advances in Cryptology -CRYPTO 2013: 33rd Annual Cryptology Conference, vol.8042, pp.40-56, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00864298

L. Ducas and P. Q. Nguyen, Learning a zonotope and more: Cryptanalysis of NTRUSign countermeasures, Advances in Cryptology -ASIACRYPT 2012: 18th International Conference on the Theory and Application of Cryptology and Information Security, vol.7658, pp.433-450, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00864359

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp.197-206, 2008.

O. Goldreich, S. Goldwasser, and S. Halevi, Public-key cryptosystems from lattice reduction problems, Advances in Cryptology -CRYPTO '97: 17th Annual International Cryptology Conference, vol.1294, pp.112-131, 1997.

J. Hoffstein, N. Howgrave-graham, J. Pipher, J. H. Silverman, and W. Whyte, NTRUSign: Digital signatures using the NTRU lattice, Topics in Cryptology -CT-RSA 2003: The Cryptographers' Track at the RSA Conference, vol.2612, pp.122-140, 2003.

J. Hoffstein, J. Pipher, and J. H. Silverman, NTRU: A ring-based public key cryptosystem, Algorithmic Number Theory: Third International Symposiun, ANTS-III Portland, vol.1423, pp.267-288, 1998.

P. Klein, Finding the closest lattice vector when it's unusually close, Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms. pp. 937-941. SODA '00, 2000.

A. K. Lenstra, H. W. Lenstra, and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.261, issue.4, pp.515-534, 1982.

M. Liu and P. Q. Nguyen, Solving BDD by enumeration: An update, Topics in Cryptology -CT-RSA 2013: The Cryptographers' Track at the RSA Conference, vol.7779, pp.293-309, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00864361

D. Micciancio, Improving lattice based cryptosystems using the hermite normal form, Lecture Notes in Computer Science, vol.2146, pp.126-145, 2001.

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

P. Q. Nguyen and O. Regev, Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures, Advances in Cryptology -EUROCRYPT 2006: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol.4004, pp.271-288, 2006.

T. Plantard, W. Susilo, and K. T. Win, A digital signature scheme based on CVP?, Public Key Cryptography -PKC 2008: 11th International Workshop on Practice and Theory in Public-Key Cryptography, vol.4939, pp.288-307, 2008.

C. P. Schnorr and M. Euchner, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Mathematical Programming, vol.66, issue.1-3, pp.181-199, 1994.

P. W. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.124-134, 1994.

V. Shoup, NTL: A library for doing number theory, 2001.

W. Stein, Sage Mathematics Software Version 7.5.1. The Sage Development Team, 2017.