R. Barbelescu, P. Gaudry, A. Joux, and E. Thomé, A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic, Advances in Cryptology? EUROCRYPT 2014, pp.1-16, 2014.
DOI : 10.1007/978-3-642-55220-5_1

R. Elwyn, R. J. Berlekamp, and M. , On the inherent intractability of certain coding problems, IEEE Transactions on Information Theory, vol.24, issue.3, pp.384-386, 1978.

F. Chabaud and J. Stren, The cryptographic security of the syndrom decoding problem for rank distance codes, Advances in Cryptology-ASIACRYPT'96, pp.368-381, 1996.

P. Gaborit, G. Murat, O. Ruatta, and G. Zémor, Low Rank Parity Check codes and their application to cryptography, The preproceedings of Workshop on Codes and Cryptography (WCC), pp.167-179, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00913719

P. Gaborit, O. Ruatta, and J. Schrek, On the complexity of the Rank Syndrome Decoding problem. arXiv preprint, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01280904

A. Ingleton, The Rank of Circulant Matrices, Journal of the London Mathematical Society, vol.1, issue.4, pp.445-460, 1956.
DOI : 10.1112/jlms/s1-31.4.445

H. Lidl and R. Niederreiter, Finite Fields, 1997.
DOI : 10.1017/CBO9780511525926

J. Robert and . Mceliece, A Public-Key Cryptosystem Based On Algebraic Coding Theory, DSN Progress Report, vol.42, issue.44, pp.114-116, 1978.

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

G. Philippe and Z. Gilles, On the hardness of the decoding and the minimum distance problems for rank codes. arXiv preprint arXiv :1404, 2014.

L. Pierre, On cellular code and their cryptographic applications

N. Sendrier, Finding the permutation between equivalent linear codes: the support splitting algorithm, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1193-1203, 2000.
DOI : 10.1109/18.850662