O. Aciiçmez, S. Gueron, and J. Seifert, New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures, pp.185-203, 2007.

O. Aciiçmez, Ç. Kaya-koç, and J. Seifert, On the Power of Simple Branch Prediction Analysis, pp.312-320, 2007.

O. Aciiçmez, Ç. Kaya-koç, and J. Seifert, Predicting Secret Keys Via Branch Prediction, pp.225-242, 2007.

S. Akleylek, N. Bindel, J. A. Buchmann, J. Krämer, and G. A. Marson, An Efficient Lattice-Based Signature Scheme with Provably Secure Instantiation, AFRICACRYPT (LNCS), pp.44-60, 2016.
DOI : 10.1007/978-3-319-31517-1_3

I. Beer, Linux: perf_event_open() can race with execve() Google Project Zero bug report, p.807, 2016.

N. Bindel, J. A. Buchmann, and J. Krämer, Lattice-Based Signature Schemes and Their Sensitivity to Fault Attacks, 2016 Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC), pp.63-77, 2016.
DOI : 10.1109/FDTC.2016.11

Y. Bistritz and A. Lifshitz, Bounds for resultants of univariate and bivariate polynomials, Linear Algebra and its Applications, vol.432, issue.8, 1995.
DOI : 10.1016/j.laa.2009.08.012

URL : https://doi.org/10.1016/j.laa.2009.08.012

M. Braithwaite, Experimenting with Post-Quantum Cryptography, 2016.

H. Cohen, A Course in Computational Algebraic Number Theory. Number 138 in Graduate Texts in Mathematics, 1993.

J. Jean-sébastien-coron, M. Großschädl, P. Tibouchi, and . Vadnala, Conversion from Arithmetic to Boolean Masking with Logarithmic Complexity, pp.130-149, 2015.

Ö. Dagdelen, F. Bansarkhani, T. Göpfert, T. Güneysu, T. Oder et al., High-Speed Signatures from Standard Lattices, pp.84-103, 2014.
DOI : 10.1007/978-3-319-16295-9_5

URL : http://www.emsec.rub.de/media/sh/veroeffentlichungen/2015/04/15/lwesign.pdf

L. Ducas, Accelerating BLISS: the geometry of ternary polynomials, IACR Cryptology ePrint Archive, vol.2014874, issue.874, 2014.

L. Ducas, A. Durmus, T. Lepoint, and V. Lyubashevsky, Lattice Signatures and Bimodal Gaussians, pp.40-56, 2013.
DOI : 10.1007/978-3-642-40041-4_3

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

L. Ducas and T. Lepoint, BLISS: Bimodal Lattice Signature Schemes, 2013.

L. Ducas, V. Lyubashevsky, and T. Prest, Efficient Identity-Based Encryption over NTRU Lattices, pp.22-41, 2014.
DOI : 10.1007/978-3-662-45608-8_2

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

L. Ducas and P. Q. Nguyen, Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures, pp.433-450, 2012.
DOI : 10.1007/978-3-642-34961-4_27

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

C. Nagarjun, S. D. Dwarakanath, and . Galbraith, Sampling from discrete Gaussians for lattice-based cryptography on a constrained device, Appl. Algebra Eng. Commun. Comput, vol.25, issue.3, pp.159-180, 2014.

T. Espitau, P. Fouque, A. Gélin, and P. Kirchner, Computing Generator in Cyclotomic Integer Rings, IACR Cryptology ePrint Archive, vol.2016, p.957, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01518438

T. Espitau, P. Fouque, B. Gérard, and M. Tibouchi, Loop-Abort Faults on Lattice-Based Fiat-Shamir and Hash-and-Sign Signatures, 2016.
DOI : 10.1007/978-3-662-44709-3_20

T. Espitau, P. Fouque, B. Gérard, and M. Tibouchi, Side-Channel Attacks on BLISS Lattice-Based Signatures, Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security , CCS '17, 2017.
DOI : 10.1016/j.laa.2009.08.012

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

C. Gentry, J. Jonsson, J. Stern, and M. Szydlo, Cryptanalysis of the NTRU Signature Scheme (NSS) from Eurocrypt, pp.1-20, 2001.

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the fourtieth annual ACM symposium on Theory of computing, STOC 08, pp.197-206, 2008.
DOI : 10.1145/1374376.1374407

URL : http://eprint.iacr.org/2007/432.pdf

C. Gentry and M. Szydlo, Cryptanalysis of the Revised NTRU Signature Scheme, pp.299-320, 2002.
DOI : 10.1007/3-540-46035-7_20

O. Goldreich, S. Goldwasser, S. Halevi, B. S. Kaliski, and J. , Public-key cryptosystems from lattice reduction problems, CRYPTO (LNCS), pp.112-131, 1997.
DOI : 10.1007/BFb0052231

URL : http://www.lcs.mit.edu/publications/pubs/pdf/MIT-LCS-TR-703.pdf

L. Groot-bruinderink, A. Hülsing, T. Lange, and Y. Yarom, Flush, Gauss, and Reload ??? A Cache Attack on the BLISS Lattice-Based Signature Scheme, pp.323-345, 2016.
DOI : 10.1145/2660267.2660356

D. Gruss, R. Spreitzer, and S. Mangard, Cache Template Attacks: Automating Attacks on Inclusive Last-Level Caches USENIX Association, pp.897-912, 2015.

T. Güneysu, V. Lyubashevsky, and T. Pöppelmann, Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems, pp.530-547, 2012.
DOI : 10.1007/978-3-642-33027-8_31

G. Optimization and . Inc, Gurobi Optimizer Reference Manual, 2016.

N. Herath and A. Fogh, CPU Hardware Performance Counters for Security. BlackHat USA 2015 briefing http://www.blackhat.com/us- 15/briefings.html#these-are-not-your-grand-daddys-cpu-performance- counters-cpu-hardware-performance-counters-for-security, 2015.

J. Hoffstein, N. Howgrave-graham, J. Pipher, J. H. Silverman, and W. Whyte, NTRUSign: Digital Signatures Using the NTRU Lattice, pp.122-140, 2003.
DOI : 10.1007/3-540-36563-X_9

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

J. Hoffstein, J. Pipher, J. M. Schanck, J. H. Silverman, and W. Whyte, Practical Signatures from the Partial Fourier Recovery Problem, ACNS (LNCS), pp.476-493, 2014.
DOI : 10.1007/978-3-319-07536-5_28

URL : https://eprint.iacr.org/2013/757.pdf

J. Howe, T. Pöppelmann, O. Máire, E. O. Neill, T. Sullivan et al., Practical Lattice-Based Digital Signature Schemes, ACM Transactions on Embedded Computing Systems, vol.14, issue.3, pp.3-41, 2015.
DOI : 10.1007/978-3-7091-6571-3

J. Howe, T. Pöppelmann, O. Máire, E. O. Neill, T. Sullivan et al., Practical Lattice-Based Digital Signature Schemes. Slides of the presentation at the NIST Workshop of Cybersecurity in a Post-Quantum World, 2015.
DOI : 10.1145/2724713

N. Howgrave-graham and M. Szydlo, A Method to Solve Cyclotomic Norm Equations, pp.272-279, 2004.
DOI : 10.1007/978-3-540-24847-7_20

Y. Kim, R. Daly, J. Kim, C. Fallin, J. Lee et al., Flipping bits in memory without accessing them, ISCA. IEEE Computer Society, pp.361-372, 2014.
DOI : 10.1145/2678373.2665726

C. Paul, J. Kocher, B. Jaffe, P. Jun, and . Rohatgi, Introduction to differential power analysis, J. Cryptographic Engineering, vol.1, issue.1, pp.5-27, 2011.

V. Lyubashevsky, Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures, pp.598-616, 2009.
DOI : 10.1007/978-3-642-10366-7_35

URL : http://cseweb.ucsd.edu/%7Evlyubash/papers/FSAbortAsiacryptconf.pdf

V. Lyubashevsky, Lattice Signatures without Trapdoors, pp.738-755, 2012.
DOI : 10.1007/978-3-642-29011-4_43

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

D. Micciancio and M. Walter, Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time, IACR Cryptology ePrint Archive, vol.37, issue.259, p.259, 2017.
DOI : 10.1007/978-3-662-43414-7_19

M. Naehrig and . Others, Lattice Cryptography Library (version 1.0), 2016.

Q. Phong, O. Nguyen, and . Regev, Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures, J. Cryptology, vol.22, issue.2, pp.139-160, 2009.

E. Oswald and S. Mangard, Template Attacks on Masking???Resistance Is Futile, pp.243-256, 2007.
DOI : 10.1007/11967668_16

C. Peikert, An Efficient and Parallel Gaussian Sampler for Lattices, CRYPTO 2010 (LNCS), pp.80-97, 2010.
DOI : 10.1007/978-3-642-14623-7_5

URL : http://www.cc.gatech.edu/~cpeikert/pubs/pargauss.pdf

T. Pöppelmann, L. Ducas, and T. Güneysu, Enhanced Lattice-Based Signatures on Reconfigurable Hardware, pp.353-370, 2014.
DOI : 10.1007/978-3-662-44709-3_20

T. Pöppelmann, T. Oder, and T. Güneysu, High-Performance Ideal Lattice-Based Cryptography on 8-Bit ATxmega Microcontrollers, pp.346-365, 2015.
DOI : 10.1007/978-3-319-22174-8_19

E. Prouff and M. Rivain, Masking against Side-Channel Attacks: A Formal Security Proof, pp.142-159, 2013.
DOI : 10.1007/978-3-642-38348-9_9

URL : http://www.ssi.gouv.fr/IMG/pdf/Masking_against_Side-Channel_Attacks_prouff-rivain.pdf

O. Markku-juhani and . Saarinen, Arithmetic coding and blinding countermeasures for lattice signatures, Journal of Cryptographic Engineering, p.14, 2017.

A. Steffen, Bimodal Lattice Signature Scheme (BLISS) in strongSwan, 2015.

A. Steffen and . Others, strongSwan: the Open Source IPsec-based VPN Solution (version 5.5.2), 2017.

J. Von, Z. Gathen, and D. Panario, Factoring Polynomials Over Finite Fields: A Survey, Journal of Symbolic Computation, vol.31, pp.3-17, 2001.