A. Banerjee, C. Peikert, and A. Rosen, Pseudorandom Functions and Lattices, Advances in Cryptology?EUROCRYPT 2012, pp.719-737, 2012.
DOI : 10.1007/978-3-642-29011-4_42

C. Berbain, H. Gilbert, and J. Patarin, QUAD: A Practical Stream Cipher with Provable Security, Advances in Cryptology-EUROCRYPT 2006, pp.109-128, 2006.
DOI : 10.1007/11761679_8

E. Berlekamp, R. Mceliece, and H. Van-tilborg, On the inherent intractability of certain coding problems (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.3, pp.384-386, 1978.
DOI : 10.1109/TIT.1978.1055873

J. Daniel and . Bernstein, Grover vs. McEliece, Lecture Notes in Comput. Sci, vol.6061, pp.73-80, 2010.

L. Blum, M. Blum, and M. Shub, A Simple Unpredictable Pseudo-Random Number Generator, SIAM Journal on Computing, vol.15, issue.2, pp.364-383, 1986.
DOI : 10.1137/0215025

M. Blum and S. Micali, How to Generate Cryptographically Strong Sequences of Pseudorandom Bits, SIAM Journal on Computing, vol.13, issue.4, pp.850-864, 1984.
DOI : 10.1137/0213053

M. Boyer, G. Brassard, P. Høyer, and A. Tapp, Tight Bounds on Quantum Searching, Fortschritte der Physik, vol.46, issue.4-5, p.493, 1998.
DOI : 10.1002/(SICI)1521-3978(199806)46:4/5<493::AID-PROP493>3.0.CO;2-P

F. Chabaud and J. Stern, The cryptographic security of the syndrome decoding problem for rank distance codes, Advances in Cryptology -ASI- ACRYPT 1996, pp.368-381, 1996.
DOI : 10.1007/BFb0034862

N. Courtois, Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank, Advances in Cryptology -ASIACRYPT 2001, pp.402-421, 2001.
DOI : 10.1007/3-540-45682-1_24

R. Cramer, L. Ducas, C. Peikert, and O. Regev, Recovering Short Generators of Principal Ideals in Cyclotomic Rings, Cryptology ePrint Archive, 2015.
DOI : 10.1007/978-3-662-49896-5_20

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology -CRYPTO '86, pp.186-194, 1987.
DOI : 10.1007/3-540-47721-7_12

J. Fischer and J. Stern, An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding, Advances in Cryptology -EUROCRYPT'96, pp.245-255, 1996.
DOI : 10.1007/3-540-68339-9_22

P. Gaborit, C. Lauradoux, and N. Sendrier, SYND: a Fast Code-Based Stream Cipher with a Security Reduction, 2007 IEEE International Symposium on Information Theory, pp.186-190, 2007.
DOI : 10.1109/ISIT.2007.4557224

P. Gaborit, O. Ruatta, and J. Schrek, On the Complexity of the Rank Syndrome Decoding Problem, IEEE Transactions on Information Theory, vol.62, issue.2, 1026.
DOI : 10.1109/TIT.2015.2511786

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

P. Gaborit and G. Zémor, On the hardness of the decoding and the minimum distance problems for rank codes. CoRR, abs/1404, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01443111

K. Gibson, The Security of the Gabidulin Public Key Cryptosystem, Advances in Cryptology -EUROCRYPT '96, pp.212-223, 1996.
DOI : 10.1007/3-540-68339-9_19

L. Goubin and N. Courtois, Cryptanalysis of the TTM Cryptosystem, Advances in Cryptology -ASIACRYPT 2000, pp.44-57, 1976.
DOI : 10.1007/3-540-44448-3_4

L. K. Grover, Quantum Mechanics Helps in Searching for a Needle in a Haystack, Physical Review Letters, vol.79, issue.2, p.325, 1997.
DOI : 10.1103/PhysRevLett.79.325

J. Håstad, R. Impagliazzo, A. Leonid, M. Levin, and . Luby, A Pseudorandom Generator from any One-way Function, SIAM Journal on Computing, vol.28, issue.4, pp.1364-1396, 1999.
DOI : 10.1137/S0097539793244708

A. Hauteville and J. Tillich, New algorithms for decoding in the rank metric and an attack on the LRPC cryptosystem, 2015 IEEE International Symposium on Information Theory (ISIT), 2015.
DOI : 10.1109/ISIT.2015.7282956

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

A. Kipnis and A. Shamir, Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization, Advances in Cryptology -CRYPTO'99, pp.19-30, 1999.
DOI : 10.1007/3-540-48405-1_2

A. Leonid and . Levin, One way functions and pseudorandom generators, Combinatorica, vol.7, issue.4, pp.357-363, 1987.

F. Lévy, -. Vehel, and L. Perret, Algebraic decoding of codes in rank metric, proceedings of YACC06, 2006.

R. Lidl and H. Niederreiter, Finite fields, volume 20 of Encyclopedia of Mathematics and its Applications, 1997.

R. J. Mceliece, A Public-Key System Based on Algebraic Coding Theory, pp.114-116, 1978.

M. Meziani, G. Hoffmann, and P. Cayrel, Improving the Performance of the SYND Stream Cipher, Progress in Cryptology - AFRICACRYPT 2012, pp.99-116, 2012.
DOI : 10.1007/978-3-642-31410-0_7

URL : https://hal.archives-ouvertes.fr/ujm-00865533

A. V. Ourivski and T. Johansson, New technique for decoding codes in the rank metric and its cryptography applications. Problems of Information Transmission, pp.237-246, 2002.

P. Spaenlenhauer, Résolution de systèmes multi-homogènes et determinantiels, 2012.

C. Andrew and . Yao, Theory and application of trapdoor functions, Foundations of Computer Science SFCS'08. 23rd Annual Symposium on, pp.80-91, 1982.