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

E. R. Berlekamp, R. J. Mceliece, and H. C. 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

F. J. Macwilliams, Permutation Decoding of Systematic Codes, Bell System Technical Journal, pp.485-505, 1964.
DOI : 10.1002/j.1538-7305.1964.tb04075.x

F. J. Macwilliams and N. J. Sloane, The theory of Error-Correcting Codes The Netherlands, 2009.

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

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

A. Canteaut and F. Chabaud, A new algorithm for finding minimum-weight words in a linear code : application to a primitive narrow-sense BCH codes of length 511, IEEE Transactions on Information Theory, pp.367-378, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00074006

D. J. Bernstein, T. Lange, and C. Peters, Attacking and Defending the McEliece Cryptosystem, Post-quantum cryptography: second international workshop, 2008.
DOI : 10.1007/0-387-34799-2_10

C. Chabot and M. Legeay, Using permutation group for decoding, Proceedings of the Twelfth International Workshop on Algebraic and Combinatorial Coding Theory, ACCT-12, pp.86-92, 2010.

P. Loidreau, Codes derived from binary Goppa codes, Problems of Information Transmission, pp.91-99, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00967387

P. Loidreau, Strengthening McEliece Cryptosystem, Advances in Cryptology (ASIACRYPT 200), pp.585-598, 2000.
DOI : 10.1007/3-540-44448-3_45

T. P. Berger, P. L. Cayrel, P. Gaborit, and A. Otmani, Reducing Key Length of the McEliece Cryptosystem, Progress in Cryptology -Second International Conference on Cryptology in Africa, pp.77-97, 2009.
DOI : 10.1007/BFb0019850
URL : https://hal.archives-ouvertes.fr/hal-01081727

D. Augot, M. Finiasz, P. Gaborit, S. Manuel, and N. Sendrier, Sha-3 proposal : FSB, 2008.

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

P. Loidreau and N. Sendrier, Weak keys in the McEliece public-key cryptosystem, IEEE Transactions on Information Theory, vol.47, issue.3, pp.1207-1212, 2001.
DOI : 10.1109/18.915687