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

M. Baldi, M. Bianchi, and F. Chiaraluce, Security and complexity of the McEliece cryptosystem based on QC-LDPC codes, 2012.

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, F. Chiaraluce, and R. Garello, On the usage of quasicyclic low-density parity-check codes in the McEliece cryptosystem, Proceedings of the First International Conference on Communication and Electronics (ICEE'06), pp.305-310, 2006.

M. Baldi, F. Chiaraluce, R. Garello, and F. Mininni, Quasi-cyclic low-density parity-check codes in the McEliece cryptosystem, IEEE International Conference on Communications, pp.951-956, 2007.

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

P. S. Barreto, P. Cayrel, R. Misoczki, and R. Niebuhr, Quasi-Dyadic CFS Signatures, The 6th China International Conference on Information Security and Cryptology, pp.336-349, 2010.
DOI : 10.1007/978-3-642-21518-6_23
URL : https://hal.archives-ouvertes.fr/hal-00870939

. A. Bjmm12, A. Becker, A. Joux, A. May, and . Meurer, Decoding random binary linear codes in 2 n/20 : How 1+1=0 improves information set decoding, Advances in Cryptology BIBLIOGRAPHY volume 7237 of Lecture Notes in Computer Science, pp.520-536, 2012.

P. S. Barreto, R. Lindner, and R. Misoczki, Monoidic Codes in Cryptography, In Post-Quantum Cryptography Lecture Notes in Computer Science, vol.21, issue.4, pp.179-199, 2002.
DOI : 10.1109/TIT.1975.1055449
URL : https://hal.archives-ouvertes.fr/hal-00870943

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

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

P. S. Barreto, R. Misoczki, and R. Lindner, Decoding Square-Free Goppa Codes Over <formula formulatype="inline"> <tex Notation="TeX">$\BBF_{p}$</tex></formula>, IEEE Transactions on Information Theory, vol.59, issue.10, pp.6851-6858
DOI : 10.1109/TIT.2013.2270272

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 5, pp.384-386, 1978.

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

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

[. Faugère, V. Gauthier, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate McEliece cryptosystems, IEEE Information Theory Workshop, pp.282-286, 2007.

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

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

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

]. Fopt10a, A. Faugère, L. Otmani, J. Perret, and . Tillich, Algebraic cryptanalysis of McEliece variants with compact keys, Advances in Cryptology, pp.279-298, 2010.

]. Fopt10b, A. Faugère, L. Otmani, J. Perret, and . Tillich, Algebraic cryptanalysis of mceliece variants with compact keys ? towards a complexity analysis, 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, Advances in Cryptology, pp.88-105, 2009.
DOI : 10.1007/978-3-642-10366-7_6

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

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

J. K. Gibson, Severely denting the Gabidulin version of the McEliece public key cryptosystem. Designs, Codes and Cryptography, pp.37-45, 1995.

J. K. Gibson, The Security of the Gabidulin Public Key Cryptosystem, Advances in Cryptology, pp.212-223, 1996.
DOI : 10.1007/3-540-68339-9_19

P. Gaborit, G. Murat, O. Ruatta, and G. Zémor, Low rank parity check codes and their application to cryptography, International Workshop on Coding and Cryptography (WCC 2013), pp.168-180, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00913719

E. M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov, Ideals over a Non-Commutative Ring and their Application in Cryptology, Advances in Cryptology (EUROCRYPT'91), pp.482-489
DOI : 10.1007/3-540-46416-6_41

M. N. Gulamhusein, Simple matrix-theory proof of the discrete dyadic convolution theorem, Electronics Letters, vol.9, issue.10, pp.238-239, 1973.
DOI : 10.1049/el:19730172

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, 2001.
DOI : 10.1137/S0097539795293172

I. [. Heyse, T. Maurich, and . Güneysu, Smaller Keys for Code-Based Cryptography: QC-MDPC McEliece Implementations on Embedded Devices, Cryptographic Hardware and Embedded Systems, pp.273-292, 2013.
DOI : 10.1007/978-3-642-40349-1_16

J. Hagenauer, E. Offer, and L. Papke, On the inherent intractability of certain coding problems (corresp.), IEEE Transactions on Information Theory, vol.423, issue.63, pp.429-445, 1996.

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

H. Janwa and O. Moreno, Mceliece public key cryptosystems using algebraic-geometric codes. Designs, Codes and Cryptography, pp.293-307, 1996.
DOI : 10.1109/isit.1995.550471

K. Kobara and H. Imai, Semantically Secure McEliece Public-Key Cryptosystems -Conversions for McEliece PKC -, Public Key Cryptography, pp.19-35, 1992.
DOI : 10.1007/3-540-44586-2_2
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.9666

K. Kobara, Flexible quasi-dyadic code-based public-key encryption and signature. Cryptology ePrint Archive, Report, vol.635, issue.71, 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

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

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

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

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

R. Merkle, Secrecy, authentication and public key systems ? A certified digital signature, 1979.

V. S. Miller, Use of Elliptic Curves in Cryptography, Advances in cryptology (CRYPTO 85), pp.417-426, 1986.
DOI : 10.1007/3-540-39799-X_31

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

D. J. Mackay and R. M. Neal, Near shannon limit performance of Low Density Parity Check codes, Electronics Letters, vol.321, issue.23, pp.1645-1646, 1996.

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), 2000.
DOI : 10.1109/ISIT.2000.866513

F. J. Macwilliams and N. J. Sloane, The Theory of Error- Correcting Codes, Elsevier Science B. V, 1978.

L. Minder and A. Shokrollahi, Cryptanalysis of the Sidelnikov Cryptosystem, Advances in Cryptology, pp.347-360, 2007.
DOI : 10.1007/978-3-540-72540-4_20

R. Misoczki, J. Tillich, N. Sendrier, and P. L. Barreto, MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes, 2013 IEEE International Symposium on Information Theory, 2012.
DOI : 10.1109/ISIT.2013.6620590
URL : https://hal.archives-ouvertes.fr/hal-00870929

R. Misoczki, J. Tillich, N. Sendrier, and P. L. Barreto, MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes, 2013 IEEE International Symposium on Information Theory, pp.2069-2073, 2013.
DOI : 10.1109/ISIT.2013.6620590
URL : https://hal.archives-ouvertes.fr/hal-00870929

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

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

A. Otmani, J. P. 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

E. Persichetti, Compact McEliece keys based on quasi-dyadic Srivastava codes. Cryptology ePrint Archive, Report, vol.179, issue.1, 2011.
DOI : 10.1515/jmc-2011-0099
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.400.6035

]. C. Pet10 and . Peters, Information-set decoding for linear codes over F q, Third International Workshop on Post-Quantum Cryptography, pp.81-94, 2010.

C. Peters, Curves, Codes, and Cryptography, 2011.

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. L. Rivest, A. Shamir, and L. M. 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

W. E. Ryan, An Introduction to LDPC Codes, CRC Handbook for Coding and Signal Processing for Recording Systems, 2003.
DOI : 10.1201/9780203490310.ch36

D. V. Sarwate, On the complexity of decoding Goppa codes, IEEE Transactions on Information Theory, vol.233, issue.4 41, pp.515-516, 1977.

S. Schechter, On the inversion of certain matrices Mathematical Tables and Other Aids to Computation, pp.73-77, 1959.

N. Sendrier, Encoding information into constant weight words, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005., pp.435-438, 2005.
DOI : 10.1109/ISIT.2005.1523371

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

]. N. Sen11 and . Sendrier, Decoding one out of many, Post-Quantum Cryptography, pp.51-67

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

V. M. 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. M. Sidelnikov and S. Shestakov, On insecurity of cryptosystems based on generalized Reed-Solomon codes, Discrete Mathematics and Applications, vol.2, issue.4, pp.57-63, 1992.
DOI : 10.1515/dma.1992.2.4.439

M. Sipser and D. A. Spielman, Expander codes, IEEE Transactions on Information Theory, vol.42, issue.6, pp.1710-1722, 1996.
DOI : 10.1109/18.556667

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

R. M. Tanner, A recursive approach to low complexity codes, IEEE Transactions on Information Theory, vol.27, issue.5, pp.533-547, 2006.
DOI : 10.1109/TIT.1981.1056404

K. K. Tzeng and K. Zimmermann, On extending Goppa codes to cyclic codes (Corresp.), IEEE Transactions on Information Theory, vol.21, issue.6, pp.721-716, 1975.
DOI : 10.1109/TIT.1975.1055449

V. G. Umana and G. Leander, Practical key recovery attacks on two McEliece variants, Cryptology ePrint Archive Report, vol.509, 2009.

D. Wagner, A Generalized Birthday Problem, Advances in Cryptology (CRYPTO'97), pp.288-303, 1992.
DOI : 10.1007/3-540-45708-9_19

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

Y. X. Yang, Dyadic matrices and their potential significance in cryptography, Advances in Cryptology (Auscrypt'90), pp.308-310, 1990.

A. M. Youssef, S. Mister, and S. E. Tavares, On the design of linear transformations for substitution permutation encryption networks, Selected Areas in Cryptography (SAC'97), pp.40-48, 1997.