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

R. J. Mceliece, A public-key cryptosystem based on algebraic coding theory, 1978.

M. Girault, A (non-practical) three-pass identification protocol using coding theory, Lecture Notes in Computer Science, vol.453, pp.265-272, 1990.
DOI : 10.1007/BFb0030367

N. Sendrier and D. E. Simos, How easy is code equivalence over Fq? Preprint, 2012.

H. Dinh, C. Moore, and A. Russell, McEliece and Niederreiter Cryptosystems That Resist Quantum Fourier Sampling Attacks, Proceedings of the 31st annual conference on Advances in cryptology. CRYPTO'11, pp.761-779, 2011.
DOI : 10.1007/978-3-642-22792-9_43

N. Courtois, M. Finiasz, and N. Sendrier, How to achieve a McEliece-based digital signature scheme Advances in Cryptology -ASIACRYPT, LNCS, vol.2248, pp.157-174, 2001.

F. J. Macwilliams, Error-Correcting Codes for Multiple-Level Transmission, Bell System Technical Journal, vol.40, issue.1, pp.281-308, 1961.
DOI : 10.1002/j.1538-7305.1961.tb03986.x

A. Betten, M. Braun, H. Fripertinger, A. Kerber, A. Kohnert et al., Error-Correcting Linear Codes: Classification by Isometry and Applications, Algorithms and Computation in Mathematics, vol.18, 2006.

H. Fripertinger, Enumeration of linear codes by applying methods from algebraic combinatorics, Grazer Math. Ber, vol.328, pp.31-42, 1996.

H. Fripertinger and A. Kerber, Isometry classes of indecomposable linear codes Algebraic Algorithms and Error-Correcting Codes, Proceedings of the 11th International Symposium on Applied Algebra, pp.194-204, 1995.

P. Kaski and P. R. Ostergård, Classification Algorithms for Codes and Designs

H. Fripertinger, Enumeration of the semilinear isometry classes of linear codes, Bayrether Mathematische Schriften, vol.74, pp.100-122, 2005.

W. C. Huffman, Codes and groups Handbook of Coding Theory, pp.1345-1440, 1998.

E. Petrank and R. M. Roth, Is code equivalence easy to decide?, IEEE Transactions on Information Theory, vol.43, issue.5, pp.1602-1604, 1997.
DOI : 10.1109/18.623157

J. A. Grochow, Matrix lie algebra isomorphism Also available as arXiv:1112.2012, IEEE Conference on Computational Complexity, 2011.

L. Babai, P. Codenotti, J. A. Grochow, and Y. , Qiao: Code equivalence and group isomorphism, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms. SODA '11, pp.1395-1408, 2011.

I. Bouyukliev, About the code equivalence. Ser. Coding Theory Cryptol, pp.126-151, 2007.

T. Feulner, The automorphism groups of linear codes and canonical representatives of their semilinear isometry classes, Advances in Mathematics of Communications, vol.3, issue.4, pp.363-383, 2009.
DOI : 10.3934/amc.2009.3.363

E. F. Assmus and J. D. Key, Designs and their Codes. Volume 103 of Cambridge Tracts in Mathematics, 1992.

R. Overbeck and N. Sendrier, Code-based cryptography, pp.95-145, 2009.
DOI : 10.1007/978-3-540-88702-7_4

N. Sendrier, On the Dimension of the Hull, SIAM Journal on Discrete Mathematics, vol.10, issue.2, pp.282-293, 1997.
DOI : 10.1137/S0895480195294027

URL : https://hal.archives-ouvertes.fr/inria-00074009

D. Vertigan, Bicycle Dimension and Special Points of the Tutte Polynomial, Journal of Combinatorial Theory, Series B, vol.74, issue.2, pp.74-378, 1998.
DOI : 10.1006/jctb.1998.1860

S. Harari, A new authentication algorithm, Lecture Notes in Computer Science, vol.388, pp.91-105, 1989.
DOI : 10.1007/BFb0019849

J. Stern, An alternative to the Fiat-Shamir protocol, Advances in Cryptology EUROCRYPT 89, pp.173-180, 1990.
DOI : 10.1007/3-540-46885-4_19

J. Stern, A new identification scheme based on syndrome decoding, Proceedings of the 13th Annual International Cryptology Conference on Advances in Cryptology. CRYPTO '93, pp.13-21, 1994.
DOI : 10.1007/3-540-48329-2_2

P. L. Cayrel, P. Gaborit, and M. Girault, Identity-based identification and signature schemes using correcting codes, INRIA, pp.69-78, 2007.

P. L. Cayrel, P. Veron, and S. Yousfi-alaoui, A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem, Selected Areas in Cryptography, pp.171-186, 2011.
DOI : 10.1007/s002000050053

C. Aguilar, P. Gaborit, and J. Schrek, A new zero-knowledge code based identification scheme with reduced communication, 2011 IEEE Information Theory Workshop, pp.648-652, 2011.
DOI : 10.1109/ITW.2011.6089577

E. Berlekamp, R. Mceliece, and H. Van-tilborg, On the inherent intractability of certain coding problems (corresp.). Information Theory, IEEE Transactions on, vol.24, pp.384-386, 1978.

S. Barg, Some new NP-complete coding problems, Probl. Peredachi Inf, vol.30, pp.23-28, 1994.

C. Peters, Information-Set Decoding for Linear Codes over F q, Lecture Notes in Computer Science, vol.6061, pp.81-94, 2010.
DOI : 10.1007/978-3-642-12929-2_7

J. Stern, A method for finding codewords of small weight, Lecture Notes in Computer Science, vol.388, pp.106-113, 1989.
DOI : 10.1007/BFb0019850

H. Dinh, C. Moore, and A. Russell, Quantum fourier sampling, code equivalence, and the quantum security of the mceliece and sidelnikov cryptosystems, 2011.