]. R. References1, L. H. Ahlswede, C. Khachatrian, A. Mauduit, and . Sárközy, A complexity measure for families of binary sequences, Period. Math. Hungar, vol.46, pp.107-118, 2003.

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

R. Balasubramanian, C. Dartyge, and . Mosaki, Sur la complexité de familles d'ensembles pseudo-aléatoires. Annales de l'Institut Fourier, pp.267-296, 2014.

C. Dartyge, E. Mosaki, and A. Sárközy, On large families of subsets of the set of the integers not exceeding N, The Ramanujan Journal, vol.106, issue.3, pp.209-229, 2009.
DOI : 10.1007/s11139-008-9135-z

C. Dartyge and A. Sárközy, Large families of pseudorandom subsets formed by power residues. Uniform Distribution Theory, pp.7-38, 2007.

C. Dartyge and A. Sárközy, On Pseudo-Random Subsets of the Set of the Integers Not Exceeding N, Periodica Mathematica Hungarica, vol.32, issue.2, pp.183-200, 2007.
DOI : 10.1112/S0025579300011049
URL : https://hal.archives-ouvertes.fr/hal-00151731

C. Dartyge, A. Sárközy, and M. Szalay, On the pseudorandomness of susbsets related to primitive roots, Combinatorica, vol.31, pp.130-162, 2011.

H. Edelsbrunner, Algorithms in combinatorial geometry, 1987.
DOI : 10.1007/978-3-642-61568-9

M. Grötschel, L. Lovász, and A. Schrijver, Geometric Algorithms and Combinatorial Optimization, 1988.

A. Joux and J. Stern, Lattice Reduction: A Toolbox for the Cryptanalyst, Journal of Cryptology, vol.11, issue.3, pp.161-185, 1998.
DOI : 10.1007/s001459900042

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

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

C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences. I. Measure of pseudorandomness, the Legendre symbol, Acta Arithmetica, vol.82, issue.4, pp.365-377, 1997.

D. Micciancio and P. Voulgaris, A Deterministic Single Exponential Time Algorithm for Most Lattice Problems Based on Voronoi Cell Computations, SIAM Journal on Computing, vol.42, issue.3, pp.1364-1391, 2013.
DOI : 10.1137/100811970

Q. Phong and . Nguyen, Hermite's constant and lattice algorithms, The LLL Algorithm -Survey and Applications , Information Security and Cryptography, pp.19-69, 2010.

Q. Phong, J. Nguyen, and . Stern, Lattice reduction in cryptology: An update, Lecture Notes in Computer Science, vol.1838, pp.85-112, 2000.

Q. Phong, J. Nguyen, and . Stern, The two faces of lattices in cryptology, Lecture Notes in Computer Science, vol.2146, pp.146-180, 2001.

H. Niederreiter and I. H. Sloan, Lattice rules for multiple integration and discrepancy, Mathematics of Computation, vol.54, issue.189, pp.303-312, 1990.
DOI : 10.1090/S0025-5718-1990-0995212-4

N. H. Sleumer, Hyperplane arrangements: Construction, visualization and applications. Master's thesis, Swiss Federal Institute of Technology, 2000.

T. Tao and V. H. Vu, Additive Combinatorics, 2006.
DOI : 10.1017/CBO9780511755149