V. Herbert and C. Fontaine, Software implementation of 2-depth pairing-based homomorphic encryption scheme. Cryptology ePrint Archive, 2017.
DOI : 10.1007/s13389-018-0192-y

J. Hoffstein, N. Howgrave-graham, J. Pipher, J. H. Silverman, and W. Whyte, NTRUSIGN: Digital signatures using the NTRU lattice, LNCS, vol.2612, p.92, 2003.
DOI : 10.1007/3-540-36563-x_9

URL : http://www.ntru.com/cryptolab/pdf/NTRUSign_RSA.ps

G. Herold and E. Kirshanova, Improved algorithms for the approximate k-list problem in euclidean norm, Part I, vol.10174, p.62, 2017.
DOI : 10.1007/978-3-662-54365-8_2

J. Hoffstein, J. Pipher, and J. Silverman, NTRU: A ring-based public key cryptosystem, International Algorithmic Number Theory Symposium, vol.35, p.92, 1998.
DOI : 10.1007/bfb0054868

URL : http://www.ntru.com/technology/../NTRUFTPDocsFolder/ANTS97.ps.gz

G. Hanrot, X. Pujol, and D. Stehlé, Analyzing blockwise lattice algorithms using dynamical systems, LNCS, vol.6841, p.61, 2011.
DOI : 10.1007/978-3-642-22792-9_25

URL : https://hal.archives-ouvertes.fr/hal-00640638

M. Haque, M. Obaidur-rahman, and J. Pieprzyk, Analysing progressive-BKZ lattice reduction algorithm, Proc. NCICIT, vol.13, p.65, 2013.

S. Halevi and V. Shoup, Bootstrapping for HElib, Elisabeth Oswald and Marc Fischlin, vol.9056, p.94, 2015.
DOI : 10.1007/978-3-662-46800-5_25

A. Jäschke and F. Armknecht, Accelerating homomorphic computations on rational numbers, LNCS, vol.16, p.71, 2016.

R. Kannan, Improved algorithms for integer programming and related lattice problems, 15th ACM STOC, p.59, 1983.
DOI : 10.1145/800061.808749

R. Kannan, Minkowski's convex body theorem and integer programming, Mathematics of operations research, vol.12, issue.3, p.41, 1987.
DOI : 10.1287/moor.12.3.415

URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=2568&context=compsci

P. Kirchner and P. Fouque, An improved BKW algorithm for LWE with applications to cryptography and lattices, CRYPTO 2015, Part I, volume 9215 of LNCS, p.40, 2015.
DOI : 10.1007/978-3-662-47989-6_3

URL : http://arxiv.org/pdf/1506.02717

P. Kirchner and P. Fouque, Revisiting lattice attacks on overstretched NTRU parameters, Part I, vol.10210, p.71, 2017.
DOI : 10.1007/978-3-319-56620-7_1

A. Khedr, G. Gulak, and V. Vaikuntanathan, SHIELD: scalable homomorphic implementation of encrypted data-classifiers, IEEE Transactions on Computers, vol.65, issue.9, p.77, 2016.
DOI : 10.1109/tc.2015.2500576

URL : http://dspace.mit.edu/bitstream/1721.1/111068/1/Vaikuntanathan_SHIELD.pdf

A. Karatsuba and Y. Ofman, Multiplication of multidigit numbers on automata, Soviet Physics Doklady, vol.7, p.82, 1963.

K. Laine, H. Chen, and R. Player, Simple Encrypted Arithmetic Library-SEAL v2, vol.3, p.114, 2017.

T. Lepoint, A proof-of-concept implementation of the homomorphic evaluation of SIMON using FV and YASHE leveled homomorphic cryptosystems, vol.25, p.48, 2014.

K. Laine and K. Lauter, Key recovery for LWE in polynomial time, Cryptology ePrint Archive, vol.176, p.113, 2015.

H. W. Arjen-klaas-lenstra, L. Lenstra, and . Lovász, Factoring polynomials with rational coefficients, Mathematische Annalen, vol.261, issue.4, p.57, 1982.

V. Lyubashevsky and D. Micciancio, On bounded distance decoding, unique shortest vectors, and the minimum distance problem, LNCS, vol.5677, p.32, 2009.
DOI : 10.1007/978-3-642-03356-8_34

URL : https://link.springer.com/content/pdf/10.1007%2F978-3-642-03356-8_34.pdf

M. Liu and P. Q. Nguyen, Solving BDD by enumeration: An update, LNCS, vol.7779, p.48, 2013.
DOI : 10.1007/978-3-642-36095-4_19

URL : https://hal.archives-ouvertes.fr/hal-00864361