A. Akavia, S. Goldwasser, and V. Vaikuntanathan, Simultaneous Hardcore Bits and Cryptography against Memory Attacks, Lecture Notes in Computer Science, vol.5444, pp.474-495, 2009.
DOI : 10.1007/978-3-642-00457-5_28

M. Albrecht, C. Cid, J. Faugère, R. Fitzpatrick, and L. Perret, On the complexity of the arora-ge algorithm against lwe, SCC '12: Proceedings of the 3nd International Conference on Symbolic Computation and Cryptography, pp.93-99, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00776434

M. R. Albrecht, R. Fitzpatrick, D. Cabracas, F. Göpfert, and M. Schneider, A generator for LWE and Ring-LWE instances, 2013

B. Applebaum, D. Cash, C. Peikert, and A. Sahai, Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems, Advances in Cryptology ? CRYPTO 2009, pp.595-618, 2009.
DOI : 10.1007/978-3-642-03356-8_35
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.153.2341

S. Arora and R. Ge, New Algorithms for Learning in Presence of Errors, Lecture Notes in Computer Science, vol.6755, pp.403-415, 2011.
DOI : 10.1007/978-3-540-85174-5_31

A. Blum, A. Kalai, and H. Wasserman, Noise-tolerant learning, the parity problem, and the statistical query model, Journal of the ACM, vol.50, issue.4, pp.506-519, 2003.
DOI : 10.1145/792538.792543

Z. Brakerski, A. Langlois, C. Peikert, O. Regev, and D. Stehlé, Classical hardness of learning with errors, Proceedings of the 45th annual ACM symposium on Symposium on theory of computing, STOC '13, pp.575-584, 2013.
DOI : 10.1145/2488608.2488680
URL : https://hal.archives-ouvertes.fr/hal-00922194

Z. Brakerski and V. Vaikuntanathan, Efficient Fully Homomorphic Encryption from (Standard) LWE, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.97-106, 2011.
DOI : 10.1109/FOCS.2011.12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.6463

Y. Chen and P. Q. Nguyen, BKZ 2.0: Better Lattice Security Estimates, Advances in Cryptology -ASIACRYPT 2011, pp.1-20, 2011.
DOI : 10.1007/978-3-642-25385-0_1
URL : https://hal.archives-ouvertes.fr/hal-01109961

L. Ducas, A. Durmus, T. Lepoint, and V. Lyubashevsky, Lattice Signatures and Bimodal Gaussians, Lecture Notes in Computer Science, vol.8042, issue.1, pp.40-56, 2013.
DOI : 10.1007/978-3-642-40041-4_3
URL : https://hal.archives-ouvertes.fr/hal-00864298

P. Fouque, An improved LPN algorithm, Security and Cryptography for Networks, 5th International Conference, pp.348-359, 2006.
URL : https://hal.archives-ouvertes.fr/inria-00563959

C. Gentry, S. Halevi, and N. P. Smart, Homomorphic Evaluation of the AES Circuit, Advances in Cryptology ? CRYPTO 2012, pp.850-867
DOI : 10.1007/978-3-642-32009-5_49

S. Goldwasser, Y. T. Kalai, C. Peikert, and V. Vaikuntanathan, Robustness of the Learning with Errors assumption, ICS, pp.230-240, 2010.

S. Halevi and V. Shoup, Design and Implementation of a Homomorphic-Encryption Library, 2013. 16 Kashmir Hill. Blueprints of NSA's ridiculously expensive data center in utah suggest it holds less info than thought blueprints-of-nsa-data-center-in-utah-suggest-its-storage-capacity-is-less-impressive-than-thought, 2013.

E. Jones, T. Oliphant, and P. Peterson, SciPy: Open source scientific tools for Python, 2001.

P. Kirchner, Improved generalized birthday attack. Cryptology ePrint Archive, Report, vol.377, 2011.

R. Lindner and C. Peikert, Better Key Sizes (and Attacks) for LWE-Based Encryption, IACR Cryptology ePrint Archive, vol.66, issue.6, p.592, 2010.
DOI : 10.1007/3-540-45708-9_19

M. Liu and P. Q. Nguyen, Solving BDD by Enumeration: An Update, Topics in Cryptology -CT-RSA 2013, pp.293-309, 2013.
DOI : 10.1007/978-3-642-36095-4_19
URL : https://hal.archives-ouvertes.fr/hal-00864361

D. Micciancio and O. Regev, Lattice-based cryptography, Post-Quantum Cryptography, pp.147-191, 2009.

J. J. Moré, B. S. Garbow, and K. E. Hillstrom, User Guide for MINPACK-1, 1980.

K. Pietrzak and L. Subspace, Subspace LWE, Lecture Notes in Computer Science, vol.7194, pp.548-563, 2012.
DOI : 10.1007/978-3-642-28914-9_31

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, J. ACM, vol.56, issue.6, 2009.

W. A. Stein, The Sage Development Team, Sage Mathematics Software, 2013.

N. P. Joop-van-de-pol and . Smart, Estimating Key Sizes for High Dimensional Lattice-Based Systems, Cryptology ePrint Archive, vol.630, 2013.
DOI : 10.1007/978-3-642-45239-0_17