M. R. Albrecht, R. Player, and S. Scott, On the concrete hardness of learning with errors, Journal of Mathematical Cryptology, vol.9, issue.3, pp.169-203, 2015.

D. Aggarwal, G. K. Brennen, T. Lee, M. Santha, and M. Tomamichel, Quantum attacks on Bitcoin, and how to protect against them, 2017.

S. Akleylek, N. Bindel, J. Buchmann, J. Kramer, and G. A. Marson, An efficient lattice-based signature scheme with provably secure instantiation, International Conference on Cryptology in Africa, pp.44-60, 2016.

J. P. Aumasson, S. Neves, Z. Wilcox-o'hearn, and C. Winnerlein, BLAKE2: simpler, smaller, fast as MD5, International Conference on Applied Cryptography and Network Security, pp.119-135, 2013.

S. Arora and R. Ge, New algorithms for learning in presence of errors, International Colloquium on Automata, Languages, and Programming, pp.403-415

. Springer, , 2011.

L. Babai, A las vegas-NC algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues, 27th FOCS, pp.303-312, 1986.

A. Blum, A. Kalai, and H. Wasserman, Noise-tolerant learning, the parity problem, and the statistical query model, 32nd ACM STOC, pp.435-440, 2000.

P. S. Barreto, P. Longa, M. Naehrig, J. E. Ricardini, and G. Zanon, Sharper Ring-LWE Signatures, Cryptology ePrint Archive, 1026.

A. Chopra, Improved Parameters for the Ring-TESLA Digital Signature Scheme, IACR Cryptology ePrint Archive, vol.2016, p.1099, 2016.

L. Ducas, A. Durmus, T. Lepoint, and V. Lyubashevsky, Lattice signatures and bimodal Gaussians, Advances in Cryptology -CRYPTO 2013, vol.8042, pp.40-56, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00864298

M. J. Dworkin, SHA-3 Standard: Permutation-Based Hash and Extendable-Output Functions. National Institute of Standards and Technology (NIST), 2015.

, FIPS PUB 186-4, Digital Signature Standard (DSS), 2013.

, FIPS PUB 180-4, Secure Hash Standard (SHS)

L. K. Grover, A fast quantum mechanical algorithm for database search, Proc. ACM STOC 1996, pp.212-219, 1996.

A. K. Lenstra, H. W. Lenstra, and L. Lovasz, Factoring polynomials with rational coefficients, vol.261, pp.513-534, 1982.

V. Lyubashevsky, C. Peikert, and O. Regev, On ideal lattices and learning with errors over rings, EUROCRYPT, pp.1-23, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00921792

S. Nakamoto, Bitcoin: A peer-to-peer digital cash system, 2009.

R. L. Rivest, A. Shamir, A. , and L. , A Method for Obtaining Digital Signatures and Public-Key Cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.

. P. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Computing, vol.26, pp.1484-1509, 1997.