E. Agrell, T. Eriksson, A. Vardy, and K. Zeger, Closest point search in lattices, IEEE Transactions on Information Theory, vol.48, issue.8, pp.482201-2214, 2002.
DOI : 10.1109/TIT.2002.800499

D. Aharonov and O. Regev, Lattice problems in NP ??? coNP, Preliminary version in FOCS'04, pp.749-765, 2005.
DOI : 10.1145/1089023.1089025

M. Ajtai, Generating random lattices according to the invariant distribution. Draft of, 2006.

M. Ajtai, R. Kumar, and D. Sivakumar, A sieve algorithm for the shortest lattice vector problem, Proc. 33rd ACM Symp. on Theory of Computing (STOC), pp.601-610, 2001.

M. Ajtai, R. Kumar, and D. Sivakumar, Sampling short lattice vectors and the closest lattice vector problem, Proceedings 17th IEEE Annual Conference on Computational Complexity, pp.53-57, 2002.
DOI : 10.1109/CCC.2002.1004339

D. Cadé, X. Pujol, and D. Stehlé, FPLLL library, version 3.0. Available from http, 2008.

M. Coster, A. Joux, B. Lamacchina, A. Odlyzko, C. Schnorr et al., An improved low-density subset sum algorithm, Computational Complexity, 1992.

S. Dasgupta and A. Gupta, An elementary proof of the Johnson-Lindenstrauss lemma, 1999.

L. Devroye, Non-uniform random variate generation Available from http, 1986.

M. Dyer, A. Frieze, and R. Kannan, A random polynomial-time algorithm for approximating the volume of convex bodies, Journal of the ACM, vol.38, issue.1, pp.1-17, 1991.
DOI : 10.1145/102782.102783

U. Fincke and M. Pohst, Improved methods for calculating vectors of short length in a lattice, including a complexity analysis, Mathematics of Computation, vol.44, issue.170, pp.463-471, 1985.
DOI : 10.1090/S0025-5718-1985-0777278-8

N. Gama and P. Q. Nguyen, Finding short lattice vectors within mordell's inequality, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, 2008.
DOI : 10.1145/1374376.1374408

N. Gama and P. Q. Nguyen, Predicting Lattice Reduction, Proc. of Euro- crypt'08, pp.31-51, 2008.
DOI : 10.1007/978-3-540-78967-3_3

G. Hanrot and D. Stehlé, Improved analysis of Kannan's shortest lattice vector algorithm (extended abstract), Proceedings of Crypto 2007, pp.170-186, 2007.

J. Håstad, B. Just, J. C. Lagarias, and C. Schnorr, Polynomial time algorithms for finding integer relations among real numbers, SIAM J. Comput, vol.18, issue.5, 1989.

R. Kannan, Improved algorithms for integer programming and related lattice problems, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, 1983.
DOI : 10.1145/800061.808749

A. K. Lenstra, H. W. Lenstra, J. , and L. Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.513-534, 1982.
DOI : 10.1007/BF01457454
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.310.318

L. Lovász and S. Vempala, Simulated annealing in convex bodies and an O*(n/sup 4/) volume algorithm, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings., pp.392-417, 2006.
DOI : 10.1109/SFCS.2003.1238237

J. E. Mazo and A. M. Odlyzko, Lattice points in high-dimensional spheres, Monatshefte f??r Mathematik, vol.31, issue.1, pp.47-61, 1990.
DOI : 10.1007/BF01571276

D. Micciancio and P. Voulgaris, A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations, Proc. 42nd ACM Symp. on Theory of Computing (STOC), 2010.

D. Micciancio and P. Voulgaris, Faster exponential time algorithms for the shortest vector problem, Proc. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp.1468-1480, 2010.
DOI : 10.1137/1.9781611973075.119

P. Q. Nguyen, Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto ???97, Proc. of Crypto '99, pp.288-304, 1999.
DOI : 10.1007/3-540-48405-1_18

P. Q. Nguyen, Public-key cryptanalysis, Recent Trends in Cryptography, 2009.
DOI : 10.1090/conm/477/09304

P. Q. Nguyen and D. Stehlé, LLL on the Average, ANTS, pp.238-256, 2006.
DOI : 10.1007/11792086_18
URL : https://hal.archives-ouvertes.fr/hal-00107309

P. Q. Nguyen and T. Vidick, Sieve algorithms for the shortest vector problem are practical, Journal of Mathematical Cryptology, vol.2, issue.2, pp.181-207, 2008.
DOI : 10.1515/JMC.2008.009

M. Pohst, On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications, ACM SIGSAM Bulletin, vol.15, issue.1, pp.37-44, 1981.
DOI : 10.1145/1089242.1089247

X. Pujol and D. Stehlé, Rigorous and Efficient Short Lattice Vectors Enumeration, Proc. ASIACRYPT '08, pp.390-405, 2008.
DOI : 10.1007/BF01581144
URL : https://hal.archives-ouvertes.fr/hal-00550983

X. Pujol and D. Stehlé, Solving the shortest lattice vector problem in time 2 2.465n, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00550976

C. Schnorr, Average time fast SVP and CVP algorithms for low density lattices, 2010.

C. Schnorr, A hierarchy of polynomial time lattice basis reduction algorithms, Theoretical Computer Science, vol.53, issue.2-3, pp.201-224, 1987.
DOI : 10.1016/0304-3975(87)90064-8

C. Schnorr and M. Euchner, Lattice basis reduction: Improved practical algorithms and solving subset sum problems, Mathematical Programming, vol.13, issue.1, pp.181-199, 1994.
DOI : 10.1007/BF01581144

C. Schnorr and H. H. Hörner, Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction, Proc. of Eurocrypt '95, pp.1-12, 1995.
DOI : 10.1007/3-540-49264-X_1

V. Shoup, Number Theory C++ Library (NTL) version 5.4.1

D. Stehlé and M. Watkins, On the Extremality of an 80-Dimensional Lattice, 2010.
DOI : 10.1007/978-3-642-14518-6_27