N. T. Courtois, M. Finiasz, and N. Sendrier, How to achieve a McEliece-based digital signature scheme, ASIACRYPT, pp.157-174, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072511

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

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.

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.

J. Stern, A method for finding codewords of small weight, " in Coding Theory and Applications, ser, Lecture Notes in Computer Science, vol.388, pp.106-113, 1988.

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.

D. J. Bernstein, T. Lange, and C. Peters, Attacking and defending the McEliece cryptosystem, PQCrypto, ser. LNCS, pp.31-46, 2008.

A. May, A. Meurer, and E. Thomae, Decoding random linear codes iñ O(2 0.054n ), ASIACRYPT, ser. Lecture Notes in Computer Science, D. H
DOI : 10.1007/978-3-642-25385-0_6

A. Becker, A. Joux, A. May, and A. Meurer, Decoding random binary linear codes in 2 n/20 : How 1 + 1 = 0 improves information set decoding, EUROCRYPT, ser. Lecture Notes in Computer, pp.520-536, 2012.

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

J. Gibson, Equivalent Goppa codes and trapdoors to McElieces public key cryptosystem, Advances in Cryptology EUROCRYPT 91, pp.517-521, 1991.

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

R. Nojima, H. Imai, K. Kobara, and K. Morozov, Semantic security for the McEliece cryptosystem without random oracles, Des. Codes Cryptography, vol.49, issue.1-3, pp.289-305, 2008.

R. Dowsley, J. Müller-quade, and A. C. Nascimento, A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model, CT-RSA, pp.240-251, 2009.

L. Dallot, Towards a concrete security proof of Courtois, Finiasz and Sendrier signature scheme, WEWoRC, pp.65-77, 2007.

M. Finiasz and N. Sendrier, Security bounds for the design of code-based cryptosystems, pp.88-105, 2009.

J. Faugère, A. Otmani, L. Perret, and J. Tillich, Algebraic cryptanalysis of McEliece variants with compact keys, EUROCRYPT, ser. Lecture Notes in Computer Science, H. Gilbert, pp.279-298, 2010.

V. D. Goppa, A new class of linear correcting codes, Probl. Peredachi Inf, vol.6, issue.3, 1970.

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

N. Patterson, The algebraic decoding of Goppa codes, IEEE Transactions on Information Theory, vol.21, issue.2, pp.203-207, 1975.

J. Van-tilburg, On the McEliece public-key cryptosystem, CRYPTO '88: Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology, pp.119-131, 1990.

A. Canteaut and H. Chabanne, A further improvement of the work factor in an attempt at breaking McEliece's cryptosystem, EUROCODE 94. INRIA, pp.169-173, 1994.

A. Canteaut and F. Chabaud, Improvements of the attacks on cryptosystems based on error-correcting codes, INRIA, Tech. Rep, pp.95-116, 1995.

I. Dumer, Suboptimal decoding of linear codes : partition techniques, IEEE Transactions on Information Theory, vol.42, issue.6, pp.1971-1986, 1996.

A. Canteaut and N. Sendrier, Cryptanalysis of the original McEliece cryptosystem, " in Advances in Cryptology -ASIACRYPT'98, ser. Lecture Notes in Computer Sscience, no. 1514, pp.187-199, 1998.

J. Faugère, V. Gauthier-umana, A. Otmani, L. Perret, and J. Tillich, Distinguisher for high rate McEliece cryptosystems, Proceedings of the 2011 IEEE Information Theory Workshop, 2011.

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.

K. Kobara and H. Imai, Semantically secure McEliece public-key cryptosystems-conversions for McEliece PKC, Public Key Cryptography, 4th International Workshop on Practice and Theory in Public Key Cryptography Proceedings, ser. Lecture Notes in Computer Science, pp.19-35, 1992.

R. Nojima, H. Imai, K. Kobara, and K. Morozov, Semantic security for the McEliece cryptosystem without random oracles, Des. Codes Cryptography, vol.49, issue.1-3, pp.289-305, 2008.

R. Dowsley, J. Müller-quade, and A. C. Nascimento, A CCA2 secure public key encryption scheme based on the McEliece assumptions in the standard model, CT-RSA, pp.240-251, 2009.

T. P. Berger, P. Cayrel, P. Gaborit, and A. Otmani, Reducing key length of the McEliece cryptosystem, Progress in Cryptology -Second International Conference on Cryptology in Africa (AFRICACRYPT 2009), ser. Lecture Notes in Computer Science, B. Preneel, pp.77-97, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01081727

R. Misoczki and P. S. Barreto, Compact McEliece keys from Goppa codes, Selected Areas in Cryptography, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00870932

J. Faugère, A new efficient algorithm for computing gröbner bases (f4), Journal of Pure and Applied Algebra, vol.139, issue.1-3, pp.61-88, 1999.

W. Bosma, J. J. Cannon, and C. Playoust, The Magma algebra system I: The user language, J. Symb. Comput, vol.244, issue.3, pp.235-265, 1997.

C. Cooper, On the distribution of rank of a random matrix over a finite field, Random Struct. Algorithms, vol.17, issue.3-4, pp.197-212, 2000.

I. Marquez-corbella and R. Pellikaan, Error-correcting pairs for a public-key cryptosystem, CBC 2012, Code-based Cryptography Workshop 2012

V. Gauthier, A. Otmani, and J. Tillich, A distinguisher-based attack on a variant of McEliece's cryptosystem based on Reed-Solomon codes, arxiv cs.CR, 2012.

H. Dinh, C. Moore, and A. Russell, McEliece and Niederreiter cryptosystems that resist quantum Fourier sampling attacks, CRYPTO, ser. Lecture Notes in Computer Science, pp.761-779, 2011.

P. W. Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, SIAM J. Comput, vol.26, issue.5, pp.1484-1509, 1997.

P. Rogaway and E. , Advances in Cryptology -CRYPTO 2011 -31st Annual Cryptology Conference, Proceedings, ser. Lecture Notes in Computer Science, vol.6841, 2011.