M. Baldi, M. Bianchi, F. Chiaraluce, J. Rosenthal, and D. Schipani, Enhanced public key security for the McEliece cryptosystem. submitted, 2011.

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

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

G. Bard and M. Albrecht, M4RI(e)-Linear Algebra over F 2 (and F 2 e ) Free Open Source Software

E. Barker and A. Roginsky, Transitions : Recommendation for transitioning the use of cryptographic algorithms and key lengths, 2011.
DOI : 10.6028/NIST.SP.800-131a

A. Becker, The representation technique -Applications to hard problems in cryptography, Thèse de doctorat, 2012.

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, Advances in Cryptology - EUROCRYPT 2012, pp.520-536, 2012.
DOI : 10.1007/978-3-642-29011-4_31

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 2012, 2012.
DOI : 10.1007/978-3-642-29011-4_31

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, pp.77-97, 2009.
DOI : 10.1007/BFb0019850
URL : https://hal.archives-ouvertes.fr/hal-01081727

T. P. Berger and P. Loidreau, How to Mask the Structure of Codes for a Cryptographic Use. Designs Codes and Cryptography, pp.63-79, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00068424

E. Berlekamp, Algebraic Coding Theory, 1968.
DOI : 10.1142/9407

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. Bernstein, Minimum number of bit operations for multiplication, 2009.

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, and C. Peters, Smaller Decoding Exponents: Ball-Collision Decoding, Proceedings of Crypto 2011, pp.743-760, 2011.
DOI : 10.1007/978-3-642-22792-9_42
URL : http://repository.tue.nl/714848

D. J. Bernstein, T. Lange, and C. Peters, Wild McEliece Incognito, PQCrypto, pp.244-254, 2011.
DOI : 10.1109/TIT.1976.1055610

J. Beuchat, N. Sendrier, A. Tisserand, and G. Villard, FPGA Implementation of a Recently Published Signature Scheme, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00077045

B. Biswas and V. Herbert, Efficient Root Finding of Polynomials over Fields of Characteristic 2, WEWoRC 2009, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00626997

B. H. Bloom, Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970.
DOI : 10.1145/362686.362692

N. Courtois, M. Finiasz, and N. Sendrier, How to Achieve a McEliece-Based Digital Signature Scheme, Advances in Cryptology ? Asia- crypt'2001, pp.157-174, 2001.
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511

N. Courtois, M. Finiasz, and N. Sendrier, How to achieve a McEliecebased Digital Signature Scheme, Advances in Cryptology -ASIACRYPT 2001, pp.157-174
URL : https://hal.archives-ouvertes.fr/inria-00072511

A. Couvreur, P. Gaborit, V. Gauthier, A. Otmani, and J. Tillich, Distinguisher-based attacks on public-key cryptosystems using Reed???Solomon codes, Proceedings of WCC 2013, 2013.
DOI : 10.1007/s10623-014-9967-z
URL : https://hal.archives-ouvertes.fr/hal-00830594

W. Diffie and M. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638

I. Dumer, On minimum distance decoding of linear codes, Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, pp.50-52, 1991.

I. Dumer, On Minimum Distance Decoding of Linear Codes, Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, pp.50-52, 1991.

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

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

J. Faugère, A. Otmani, L. Perret, and J. Tillich, Algebraic Cryptanalysis of McEliece Variants with Compact Keys, Advances in Cryptology -EUROCRYPT 2010, pp.279-298, 2010.
DOI : 10.1007/978-3-642-13190-5_14

C. Faure and L. Minder, Cryptanalysis of the McEliece cryptosystem over hyperelliptic curves, Proceedings of the eleventh International Workshop on Algebraic and Combinatorial Coding Theory, pp.99-107, 2008.

M. Finiasz, Parallel-CFS, Selected Areas in Cryptography, pp.159-170, 2010.
DOI : 10.1007/3-540-45708-9_19

M. Finiasz and N. Sendrier, Security Bounds for the Design of Codebased Cryptosystems, Advances in Cryptology -ASIACRYPT 2009, pp.88-105, 2009.

V. Gauthier, A. Otmani, and J. Tillich, A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes, 1204.

N. Howgrave-graham and A. Joux, New Generic Algorithms for Hard Knapsacks, Advances in Cryptology -EURO- CRYPT 2010, pp.235-256, 2010.
DOI : 10.1007/978-3-642-13190-5_12

H. Janwa and O. Moreno, McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes. Designs Codes and Cryptography, 37] T. Johansson and F. Jönsson. On the Complexity of Some Cryptographic Problems Based on the General Decoding Problem, pp.293-307, 1996.
DOI : 10.1109/isit.1995.550471

A. Joux, Algorithmic Cryptanalysis. Chapman & Hall/CRC Cryptography and Network Security Series, 2009.
DOI : 10.1201/9781420070033

G. Kabatianskii, E. Krouk, and B. J. Smeets, A digital signature scheme based on random error-correcting codes, IMA Int. Conf., volume 1355 of Lecture Notes in Computer Science, pp.161-167, 1997.
DOI : 10.1007/BFb0024461

D. Kravitz, Digital signature algorithm. US patent 5231668 [41] G. Landais. Implementation of several CSD sol- ving algorithms. Free Open Source Software. https, 1991.

G. Landais and N. Sendrier, McEliece based si- gnature scheme. Free Open Source Software. https://gforge.inria.fr/projects/cfs-signature

G. Landais and N. Sendrier, Implementing CFS, Indocrypt 2012, pp.474-488, 2012.
DOI : 10.1007/978-3-642-34931-7_27
URL : https://hal.archives-ouvertes.fr/hal-00880644

G. Landais and J. Tillich, An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes, Proceedings of PQCrypto 2013
DOI : 10.1007/978-3-642-38616-9_7
URL : https://hal.archives-ouvertes.fr/hal-00880654

P. Lee and E. 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. 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

C. Löndahl and T. Johansson, A New Version of McEliece PKC Based on Convolutional Codes, ICICS, pp.461-470, 2012.
DOI : 10.1007/978-3-642-34129-8_45

J. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969.
DOI : 10.1109/TIT.1969.1054260

A. May, A. Meurer, and E. Thomae, Decoding random linear codes in O(2 0.054n ), LNCS, vol.7073, pp.107-124, 2011.

R. Mceliece, A public-key cryptosystem based on algebraic coding theory, DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol, pp.114-116, 1978.

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

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, J. Tillich, N. Sendrier, and P. S. Barreto, MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes, 2013 IEEE International Symposium on Information Theory, p.409, 2012.
DOI : 10.1109/ISIT.2013.6620590
URL : https://hal.archives-ouvertes.fr/hal-00870929

N. Nethercote, Cachegrind : a cache and branch-prediction profiler, 2002.

H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, pp.159-166, 1986.

A. Otmani, J. Tillich, and L. Dallot, Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes, Mathematics in Computer Science, vol.1, issue.4, pp.129-140, 2010.
DOI : 10.1007/s11786-009-0015-8
URL : https://hal.archives-ouvertes.fr/hal-01083566

A. Otmani and J. Tillich, An Efficient Attack on All Concrete KKS Proposals, LNCS, vol.42, issue.6, pp.98-116, 2011.
DOI : 10.1007/BFb0019850
URL : https://hal.archives-ouvertes.fr/hal-00913500

R. Overbeck, Public Key Cryptography based on Coding Theory, 2007.

R. Overbeck and N. Sendrier, Code-based cryptography, Post-Quantum Cryptography, pp.95-145, 2009.
DOI : 10.1007/978-3-540-88702-7_4

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. Prange, The use of information sets in decoding cyclic codes, IEEE Transactions on Information Theory, vol.8, issue.5, pp.5-9, 1962.
DOI : 10.1109/TIT.1962.1057777

R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

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

N. Sendrier, Decoding One Out of Many Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, PQ- Crypto 2011, pp.51-671484, 1997.

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

V. Sidelnikov and S. 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, 1989.
DOI : 10.1007/BFb0019850

V. G. Umana and G. Leander, Practical Key Recovery Attacks On Two McEliece Variants, 2009.

D. Wagner, A Generalized Birthday Problem Advances in Cryptology -CRYPTO, LNCS, vol.2442, pp.288-303, 2002.

V. K. Wei and K. Yang, On the generalized Hamming weights of product codes, IEEE Transactions on Information Theory, vol.39, issue.5, pp.1709-1713, 1993.
DOI : 10.1109/18.259662

C. Wieschebrink, Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography, 2006 IEEE International Symposium on Information Theory, pp.1733-1737, 2006.
DOI : 10.1109/ISIT.2006.261651

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