M. Barbier, Key reduction of mceliece's cryptosystem using list decoding. CoRR, abs, 1102.

S. L. Paulo, P. Barreto, R. Cayrel, R. Misoczki, and . Niebuhr, Quasi-dyadic CFS signatures, Lecture Notes in Computer Science, vol.6584, pp.336-349, 2010.

S. L. Paulo, R. Barreto, R. Lindner, and . Misoczki, Monoidic codes in cryptography, Lecture Notes in Computer Science, vol.7071, pp.179-199, 2011.

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, Lecture Notes in Computer Science, vol.7237, pp.520-536, 2012.
DOI : 10.1007/978-3-642-29011-4_31

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.

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. J. Bernstein, T. Lange, and C. Peters, Attacking and Defending the McEliece Cryptosystem, PQCrypto, pp.31-46, 2008.
DOI : 10.1007/0-387-34799-2_10

D. J. Bernstein, T. Lange, C. Peters, and H. Van-tilborg, Explicit bounds for generic decoding algorithms for code-based cryptography, Pre-proceedings of WCC 2009, pp.168-180, 2009.

D. J. Bernstein, T. Lange, and C. Peters, Smaller Decoding Exponents: Ball-Collision Decoding, Lecture Notes in Computer Science, vol.6841, pp.743-760, 2011.
DOI : 10.1007/978-3-642-22792-9_42
URL : http://repository.tue.nl/714848

W. Bosma, J. J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.3-4235, 1997.
DOI : 10.1006/jsco.1996.0125

B. Buchberger, Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal, 1965.

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

D. A. Cox, J. B. Little, and D. Shea, Ideals, Varieties, and algorithms: an Introduction to Computational Algebraic Geometry and Commutative Algebra, Undergraduate Texts in Mathematics, 2001.

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.
DOI : 10.1016/S0022-4049(99)00005-5

J. Faugère, A new efficient algorithm for computing gröbner bases without reduction to zero : F5, ISSAC'02, pp.75-83, 2002.

J. Faugère, FGb: A Library for Computing Gr??bner Bases, Mathematical Software -ICMS 2010, pp.84-87, 2010.
DOI : 10.1007/978-3-642-15582-6_17

J. Faugère, V. Gauthier, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate McEliece cryptosystems, IEEE Transactions on Information Theory, 2013.

J. Faugère, V. Gauthier-umana, A. Otmani, L. Perret, and J. Tillich, A Distinguisher for High Rate McEliece Cryptosystems, Information Theory Workshop (ITW), pp.282-286, 2011.

J. Faugère, A. Otmani, L. Perret, and J. Tillich, Algebraic Cryptanalysis of McEliece Variants with Compact Keys, Gilbert [26], pp.279-298
DOI : 10.1007/978-3-642-13190-5_14

J. Faugère, A. Otmani, L. Perret, and J. Tillich, Algebraic Cryptanalysis of McEliece variants with compact keys ? toward a complexity analysis, SCC '10: Proceedings of the 2nd International Conference on Symbolic Computation and Cryptography, pp.45-55, 2010.

M. Finiasz and N. Sendrier, Security Bounds for the Design of Code-Based Cryptosystems, LNCS, vol.5912, pp.88-105, 2009.
DOI : 10.1007/978-3-642-10366-7_6

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

S. Heyse, Implementation of McEliece Based on Quasi-dyadic Goppa Codes for Embedded Devices, Lecture Notes in Computer Science, vol.26, issue.5, pp.143-162
DOI : 10.1137/S0097539795293172

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

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.
DOI : 10.1109/18.915687

V. Lyubashevsky, C. Peikert, and O. Regev, On ideal lattices and learning with errors over rings, Gilbert [26], pp.1-23
URL : https://hal.archives-ouvertes.fr/hal-00921792

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

A. May, A. Meurer, and E. Thomae, Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$, Lecture Notes in Computer Science, vol.7073, pp.107-124, 2011.
DOI : 10.1007/978-3-642-25385-0_6

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

R. Misoczki and P. S. Barreto, Compact McEliece Keys from Goppa Codes, Selected Areas in Cryptography, 2009.
DOI : 10.1007/978-3-642-05445-7_24
URL : https://hal.archives-ouvertes.fr/hal-00870932

R. Misoczki and P. S. Barreto, Compact McEliece Keys from Goppa Codes, IACR Cryptology ePrint Archive, p.187, 2009.
DOI : 10.1007/978-3-642-05445-7_24
URL : https://hal.archives-ouvertes.fr/hal-00870932

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

E. Persichetti, Compact McEliece keys based on quasi-dyadic Srivastava codes, Journal of Mathematical Cryptology, vol.6, issue.2, pp.149-169, 2012.
DOI : 10.1515/jmc-2011-0099

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

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

D. Stehlé, R. Steinfeld, K. Tanaka, and K. Xagawa, Efficient Public Key Encryption Based on Ideal Lattices, Lecture Notes in Computer Science, vol.5912, pp.617-635, 2009.
DOI : 10.1007/978-3-642-10366-7_36

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

V. Gauthier-umana and G. Leander, Practical key recovery attacks on two McEliece variants, International Conference on Symbolic Computation and Cryptography?SCC, p.62, 2010.