M. Baldi and G. F. Chiaraluce, Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes, 2007 IEEE International Symposium on Information Theory, pp.2591-2595, 2007.
DOI : 10.1109/ISIT.2007.4557609

T. P. Berger, Cyclic alternant codes induced by an automorphism of a GRS code, Finite fields: Theory, Applications and Algorithms, pp.143-154, 1999.
DOI : 10.1090/conm/225/03216

T. P. Berger, Goppa and related codes invariant under a prescribed permutation, IEEE Transactions on Information Theory, vol.46, issue.7, p.2628, 2000.
DOI : 10.1109/18.887871

T. P. Berger, On the cyclicity of Goppa codes, parity-check subcodes of Goppa codes and extended Goppa codes. Finite Fields and Applications, pp.255-281, 2000.

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

B. Biswas and N. Sendrier, Mceliece cryptosystem implementation: theory and practice. PQCrypto 2008 -Lecture Notes in Computer Science, 2008.
DOI : 10.1007/978-3-540-88403-3_4

A. Shokrollahi, C. Monico, and J. Rosenthal, Using low density parity check codes in the McEliece cryptosystem, IEEE International Symposium on Information Theory, p.215, 2000.

A. Canteaut and F. Chabaud, A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511, IEEE Transactions on Information Theory, vol.44, issue.1, pp.367-378, 1998.
DOI : 10.1109/18.651067

P. L. Cayrel, A. Otmani, and D. Vergnaud, On Kabatianskii-Krouk-Smeets Signatures, Proceedings of the first International Workshop on the Arithmetic of Finite Fields, pp.237-251, 2007.
DOI : 10.1007/978-3-540-73074-3_18
URL : https://hal.archives-ouvertes.fr/hal-00259021

D. Engelbert, R. Overbeck, and A. Schmidt, A Summary of McEliece-Type Cryptosystems and their Security, Journal of Mathematical Cryptology, vol.1, issue.2, pp.151-199, 2007.
DOI : 10.1515/JMC.2007.009

P. Gaborit, Shorter keys for code based cryptography, Proceedings of the 2005 International Workshop on Coding and Cryptography (WCC 2005), pp.81-91, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00078726

P. Gaborit and M. Girault, Lightweight code-based authentication and signature, IEEE International Symposium on Information Theory, pp.191-195, 2007.

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. J. Lee and E. F. Brickell, An Observation on the Security of McEliece???s Public-Key Cryptosystem, Advances in Cryptology -EUROCRYPT'88, pp.275-280, 1988.
DOI : 10.1007/3-540-45961-8_25

J. S. Leon, A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Transactions on Information Theory, vol.34, issue.5, pp.1354-1359, 1988.
DOI : 10.1109/18.21270

Y. X. Li, R. H. Deng, and X. Wang, On the equivalence of McEliece's and Niederreiter's public-key cryptosystems, IEEE Transactions on Information Theory, vol.40, issue.1, pp.271-273, 1994.

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Codes, 1986.

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

L. Minder and A. Shokrollahi, Cryptanalysis of the Sidelnikov Cryptosystem, Eurocrypt, pp.347-360, 2007.
DOI : 10.1007/978-3-540-72540-4_20

H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory, Problems Control Inform. Theory, vol.15, issue.2, pp.159-166, 1986.

A. Otmani, J. P. Tillich, and L. Dallot, Cryptanalysis of two McEliece cryptosystems based on quasi-cyclic codes. preprint, 2008.
URL : https://hal.archives-ouvertes.fr/hal-01083566

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

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

V. M. Sidelnikov, A public-key cryptosystem based on binary Reed-Muller codes, Discrete Mathematics and Applications, vol.4, issue.3, 1994.
DOI : 10.1515/dma.1994.4.3.191

V. M. Sidelnikov and S. O. Shestakov, On insecurity of cryptosystems based on generalized Reed-Solomon codes, Discrete Mathematics and Applications, vol.2, issue.4, pp.439-444, 1992.
DOI : 10.1515/dma.1992.2.4.439

J. Stern, A method for finding codewords of small weight, Coding Theory and Applications, pp.106-113, 1988.
DOI : 10.1007/BFb0019850

C. Wieschebrink, Two NP-complete problems in coding theory with an application in code based cryptography . Information Theory, IEEE International Symposium on, pp.1733-1737, 2006.