P. Shor, Algorithms for quantum computation: discrete logarithms and factoring, Proceedings 35th Annual Symposium on Foundations of Computer Science, pp.124-134, 1994.
DOI : 10.1109/SFCS.1994.365700

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

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

J. Faugère, V. Gauthier, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate McEliece cryptosystems, Proc. IEEE Inf, pp.282-286, 2011.

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

N. Sendrier, On the use of structured codes in code based cryptography, The Royal Flemish Academy of Belgium for Science and the Arts, pp.59-68, 2010.

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

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, pp.2069-2073, 2013.
DOI : 10.1109/ISIT.2013.6620590
URL : https://hal.archives-ouvertes.fr/hal-00870929

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

I. Von-maurich and T. Güneysu, Lightweight code-based cryptography: QC-MDPC McEliece encryption on reconfigurable devices, Design, Automation & Test in Europe Conference & Exhibition, pp.1-6, 2014.

I. V. Maurich, T. Oder, and T. Güneysu, Implementing QC-MDPC McEliece Encryption, ACM Transactions on Embedded Computing Systems, vol.14, issue.3, pp.1-44, 2015.
DOI : 10.1145/2700102

C. Monico, J. Rosenthal, and A. 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

A. Vardy, The intractability of computing the minimum distance of a code, IEEE Transactions on Information Theory, vol.43, issue.6, pp.1757-1766, 1997.
DOI : 10.1109/18.641542

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, " in Coding Theory and Applications, ser. Lecture Notes in, pp.106-113, 1988.

A. May, A. Meurer, and E. Thomae, Decoding random linear codes in O(2 0.054n ), Advances in Cryptology -ASIACRYPT 2011, pp.107-124, 2011.
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, Advances in Cryptology -EUROCRYPT 2012, ser. Lecture Notes in Comput. Sci, 2012.
DOI : 10.1007/978-3-642-29011-4_31

A. May and I. Ozerov, On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes, Advances in Cryptology - EUROCRYPT 2015, pp.203-228, 2015.
DOI : 10.1007/978-3-662-46800-5_9

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, 2012.
DOI : 10.1109/ISIT.2013.6620590
URL : https://hal.archives-ouvertes.fr/hal-00870929

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