M. Ajtai, Generating hard instances of lattice problems (extended abstract), Proceedings of the twenty-eighth annual ACM symposium on Theory of computing , STOC '96, pp.99-108, 1996.
DOI : 10.1145/237814.237838

]. D. Ber09 and . Bernstein, Post-quantum cryptography, 2009.

[. Cayrel, R. Lindner, M. Rückert, and R. Silva, Improved Zero-Knowledge Identification with Lattices, ProvSec, pp.1-17, 2010.
DOI : 10.1007/3-540-45708-9_19

[. Cayrel, P. Véron, and S. M. Alaoui, A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem, Selected Areas in Cryptography, pp.171-186, 2010.
DOI : 10.1007/s002000050053

D. [. Gennaro, R. Leigh, W. Sundaram, and . Yerazunis, Batching Schnorr Identification Scheme with Applications to Privacy-Preserving Authorization and Low-Bandwidth Communication Devices, Advances in Cryptology-ASIACRYPT 2004, pp.187-198, 2004.
DOI : 10.1007/978-3-540-30539-2_20

S. [. Goldwasser, C. Micali, and . Rackoff, The knowledge complexity of interactive proofsystems, Proceedings of the seventeenth annual ACM symposium on Theory of computing, p.304, 1985.

D. [. Lyubashevsky, C. Micciancio, A. Peikert, and . Rosen, SWIFFT: A Modest Proposal for FFT Hashing, Lecture Notes in Computer Science, vol.5086, pp.54-72, 2008.
DOI : 10.1007/978-3-540-71039-4_4
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.110.4697

O. [. Micciancio and . Regev, Worst???Case to Average???Case Reductions Based on Gaussian Measures, SIAM Journal on Computing, vol.37, issue.1, pp.267-302, 2007.
DOI : 10.1137/S0097539705447360

]. P. Sho94 and . Shor, Polynominal time algorithms for discrete logarithms and factoring on a quantum computer, Lecture Notes in Computer Science, vol.877, p.289, 1994.

J. Stern, A new identification scheme based on syndrome decoding, Lecture Notes in Computer Science, vol.773, pp.13-21, 1993.
DOI : 10.1007/3-540-48329-2_2