P. W. Shor, Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, SIAM Journal on Computing, vol.26, issue.5, pp.1484-1509, 1997.
DOI : 10.1137/S0097539795293172

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

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

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.

P. Gaborit, Shorter keys for code based cryptography, International Workshop on Coding and Cryptography ? WCC'2005, pp.81-91, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00078726

T. P. Berger, P. Cayrel, P. Gaborit, and A. Otmani, Reducing Key Length of the McEliece Cryptosystem, Progress in Cryptology, Africacrypt'2009, ser. LNCS, pp.77-97, 2009.
DOI : 10.1007/BFb0019850
URL : https://hal.archives-ouvertes.fr/hal-01081727

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

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

R. G. Gallager, Low-density parity-check codes, IEEE Transactions on Information Theory, vol.8, issue.1, 1963.
DOI : 10.1109/TIT.1962.1057683

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

M. Baldi and 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

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

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

S. Ouzan and Y. Be-'ery, Moderate-density parity-check codes, 2009.

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

K. Kobara and H. Imai, Semantically Secure McEliece Public-Key Cryptosystems -Conversions for McEliece PKC -, Public Key Crypt., ser, pp.19-35, 1992.
DOI : 10.1007/3-540-44586-2_2

W. Huffman and V. Pless, Fundamentals of Error-Correcting Codes, 2003.
DOI : 10.1017/CBO9780511807077

J. Hagenauer, E. Offer, and L. Papke, Iterative decoding of binary block and convolutional codes Information Theory, IEEE Transactions on, vol.42, issue.2, pp.429-445, 1996.

N. Sendrier, On the use of structured codes in code based cryptography , " in Coding Theory and Cryptography III, ser, Koninklijke Vlaamse Acad. van België voor Wetenschaeppen en Kunsten, pp.59-68, 2009.

H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory, Prob. of Cont. and Inf. Th, vol.15, issue.2, pp.159-166, 1986.

Y. X. Li, R. H. Deng, and X. M. Wang, On the equivalence of mceliece's and niederreiter's public-key cryptosystems Information Theory, IEEE Transactions on, vol.40, issue.1, pp.271-273, 1994.

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

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

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

N. Sendrier, Decoding One Out of Many, Post-Quantum Cryptography , ser. LNCS, pp.51-67, 2011.
DOI : 10.1007/3-540-45708-9_19

P. Fouque and G. Leurent, Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes, CT-RSA 2008, ser, pp.19-35, 2008.
DOI : 10.1007/978-3-540-79263-5_2
URL : https://hal.archives-ouvertes.fr/inria-00556689

D. J. Bernstein, T. Lange, and C. Peters, Attacking and Defending the McEliece Cryptosystem, 2nd Int. Workshop on Post-Quantum Cryptography, ser. PQCrypto'08, pp.31-46, 2008.
DOI : 10.1007/0-387-34799-2_10