M. Baldi, M. Bodrato, and F. Chiaraluce, A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Security and Cryptography for Networks, pp.246-262, 2008.
DOI : 10.1007/978-3-540-85855-3_17

T. P. Berger and P. Loidreau, How to Mask the Structure of Codes for a Cryptographic Use, Designs, Codes and Cryptography, vol.4, issue.3, pp.63-79, 2005.
DOI : 10.1007/s10623-003-6151-2
URL : https://hal.archives-ouvertes.fr/hal-00068424

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

D. J. Bernstein, T. Lange, and C. Peters, Attacking and Defending the McEliece Cryptosystem, Lecture Notes in Computer Science, vol.2, issue.2, pp.31-46, 2008.
DOI : 10.1007/0-387-34799-2_10
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.3548

E. M. Gabidulin, A. V. Paramonov, and O. V. Trejakov, Ideals over a non-commutative ring and their application in cryptography, Advances in Cryptology -EUROCRYPT 91, 1991.
DOI : 10.1007/3-540-46416-6_41

E. M. Gabidulin and O. Kjelsen, How to avoid the Sidel'nikov-Shestakov attack, Error Control, Cryptology, and Speech Compression, pp.25-32, 1994.
DOI : 10.1007/3-540-58265-7_4

G. Kabatiansky, E. Krouk, and S. Semenov, Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept, 2005.
DOI : 10.1002/0470867574

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

C. Monico, J. Rosenthal, and A. Shokrollahi, Using low density parity check codes in the McEliece cryptosystem, 2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), p.215, 2000.
DOI : 10.1109/ISIT.2000.866513

H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory, Probl. Contr. and Inform. Theory, vol.15, pp.159-166, 1986.

A. Otmani, J. P. Tillich, and L. Dallot, Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes, Proc. First International Conference on Symbolic Computation and Cryptography, 2008.
DOI : 10.1007/s11786-009-0015-8
URL : https://hal.archives-ouvertes.fr/hal-01083566

A. Ourivski and E. Gabidulin, Column scrambler for the GPT cryptosystem, Discrete Applied Mathematics, vol.128, issue.1, pp.207-221, 2003.
DOI : 10.1016/S0166-218X(02)00446-8

R. Overbeck, Structural Attacks for Public Key Cryptosystems based??on Gabidulin Codes, Journal of Cryptology, vol.42, issue.44, pp.280-301, 2008.
DOI : 10.1007/s00145-007-9003-9

C. Peters, Information-Set Decoding for Linear Codes over F q, Post-Quantum Cryptography, pp.81-94, 2010.
DOI : 10.1007/978-3-642-12929-2_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.8991

H. Rashwan, E. M. Gabidulin, and B. Honary, Security of the GPT cryptosystem and its applications to cryptography, Security and Communication Networks, vol.21, issue.3, 2010.
DOI : 10.1002/sec.228

V. G. Umana and G. Leander, Practical key recovery attacks on two McEliece variants, Proc. 2nd Int. Conf. on Symbolic Computation and Cryptography, pp.27-44, 2010.

C. Wieschebrink, Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes, Post-Quantum Cryptography: PQCrypto 2010, pp.61-72, 2010.
DOI : 10.1007/978-3-642-12929-2_5