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

L. Babai, On Lov??sz??? lattice reduction and the nearest lattice point problem, Combinatorica, vol.357, issue.1, pp.1-13, 1986.
DOI : 10.1007/BF02579403

N. Brisebarre and S. Chevillard, Efficient polynomial L-approximations, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), 2006.
DOI : 10.1109/ARITH.2007.17
URL : https://hal.archives-ouvertes.fr/inria-00119513

N. Brisebarre, J. Muller, and A. Tisserand, Computing machine-efficient polynomial approximations, ACM Transactions on Mathematical Software, vol.32, issue.2, 2006.
DOI : 10.1145/1141885.1141890
URL : https://hal.archives-ouvertes.fr/ensl-00086826

E. W. Cheney, Introduction to approximation theory, 1982.

M. Cornea, J. Harrison, and P. T. Tang, Scientific Computing on Itanium-Based Systems, 2002.

L. Fousse, CRQ, the correctly rounded quadrature library for crq, 2006.

T. Granlund, GMP, the GNU multiple precision arithmetic library, version 4.2.1, 2006.

S. Safra, I. Dinur, and G. Kindler, Approximating-CVP to within almost-polynomial factors is np-hard, 39th Annual Symposium on Fundations of Computer Science, pp.99-111, 1998.

R. Kannan, Minkowski's Convex Body Theorem and Integer Programming, Mathematics of Operations Research, vol.12, issue.3, pp.415-440, 1987.
DOI : 10.1287/moor.12.3.415
URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=2568&context=compsci

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

P. Nguyen and D. Stehlé, Floating-Point LLL Revisited, Proceedings of Eurocrypt 2005, pp.215-233, 2005.
DOI : 10.1007/11426639_13
URL : https://hal.archives-ouvertes.fr/inria-00000377

E. Remes, Sur un procédé convergent d'approximations successives pour déterminer les polynômes d'approximation, C.R. Acad. Sci. Paris, vol.198, pp.2063-2065, 1934.

V. Shoup, NTL, a library for doing number theory, version 5.4, 2005.

P. Van-emde and . Boas, Another NP-complete problem and the complexity of computing short vectors in a lattice, 1981.

I. Unité-de-recherche-inria-lorraine and L. , Technopôle de Nancy-Brabois -Campus scientifique 615, rue du Jardin Botanique -BP 101 -54602 Villers-lès-Nancy Cedex (France) Unité de recherche INRIA Futurs : Parc Club Orsay Université -ZAC des Vignes 4

I. Unité-de-recherche and . Rennes, IRISA, Campus universitaire de Beaulieu -35042 Rennes Cedex (France) Unité de recherche INRIA Rhône-Alpes : 655, avenue de l'Europe -38334 Montbonnot Saint-Ismier (France) Unité de recherche INRIA Rocquencourt : Domaine de Voluceau -Rocquencourt -BP 105 -78153 Le Chesnay Cedex (France) Unité de recherche, 2004.

I. De-voluceau-rocquencourt, BP 105 -78153 Le Chesnay Cedex (France) http://www.inria.fr ISSN, pp.249-6399