C. M. Adams and H. Meijer, Security-related comments regarding McEliece's public-key cryptosystem, IEEE Transactions on Information Theory, vol.35, issue.2, pp.454-455, 1989.
DOI : 10.1109/18.32140

C. Aguilar-melchor, P. Cayrel, and P. Gaborit, A new efficient threshold ring signature scheme based on coding theory, Proceedings of the second international workshop on Post-quantum cryptography -PQCrypto, pp.1-16, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00335230

A. E. Ashikhmin and A. Barg, Minimal vectors in linear codes, IEEE Transactions on Information Theory, vol.44, issue.5, pp.2010-2017, 1998.
DOI : 10.1109/18.705584

D. Augot, M. Barbier, and A. Couvreur, List-decoding of binary Goppa codes up to the binary Johnson bound, 2011 IEEE Information Theory Workshop, pp.229-233, 2011.
DOI : 10.1109/ITW.2011.6089384

URL : https://hal.archives-ouvertes.fr/inria-00547106

D. Augot, M. Finiasz, and P. Gaborit, Stphane Manuel, and Nicolas Sendrier. Sha-3 proposal: Fsb. Submission to NIST, 2008.

D. Augot, M. Finiasz, and N. Sendrier, A Family of Fast Syndrome Based Cryptographic Hash Functions, Mycrypt, pp.64-83, 2005.
DOI : 10.1007/11554868_6

URL : https://hal.archives-ouvertes.fr/inria-00070414

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

S. Barg, Some new NP-complete coding problems, Probl. Peredachi Inf, vol.30, pp.23-28, 1994.

P. Barreto, P. Cayrel, R. Misoczki, and R. Niebuhr, Quasi dyadic cfs signature scheme, In Inscrypt, Lecture Notes in Computer Science, 2010.
DOI : 10.1007/978-3-642-21518-6_23

URL : https://hal.inria.fr/hal-00870939/document

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 -31st Annual International Conference on the Theory and Applications of Cryptographic Techniques Proceedings, volume 7237 of Lecture Notes in Computer Science, pp.520-536, 2012.
DOI : 10.1007/978-3-642-29011-4_31

M. Bellare, C. Namprempre, and G. Neven, Security Proofs for Identity-Based Identification and Signature Schemes, EUROCRYPT, pp.268-286, 2004.
DOI : 10.1007/978-3-540-24676-3_17

T. Berger, P. Cayrel, P. Gaborit, and A. Otmani, Reducing Key Length of the McEliece Cryptosystem, Progress in Cryptology, AFRICACRYPT 09, pp.77-97, 2009.
DOI : 10.1007/BFb0019850

URL : https://hal.archives-ouvertes.fr/hal-01081727

E. R. Berlekamp, R. J. Mceliece, and H. C. 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, T. Lange, C. Peters, and P. Schwabe, Really Fast Syndrome-Based Hashing, Progress in Cryptology, AFRICACRYPT 2011, pp.134-152, 2011.
DOI : 10.1007/3-540-45708-9_19

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

J. Daniel and . Bernstein, Grover vs. mceliece, 2008.

J. Daniel and . Bernstein, List decoding for binary goppa codes, 2008.

D. J. Bernstein, T. Lange, and C. Peters, Attacking and Defending the McEliece Cryptosystem, Proceedings of the 2nd International Workshop on Post-Quantum Cryptography, PQCrypto '08, 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 Advances in Cryptology -CRYPTO 2011 -31st Annual Cryptology Conference, Proceedings, volume 6841 of Lecture Notes in Computer Science, pp.743-760, 2011.

D. J. Bernstein, T. Lange, and C. Peters, Smaller decoding exponents: Ball-collision decoding Advances in Cryptology -CRYPTO 2011 -31st Annual Cryptology Conference, Proceedings, volume 6841 of Lecture Notes in Computer Science, 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, Selected Areas in Cryptography, pp.143-158, 2011.
DOI : 10.1109/18.21264

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 N. Sendrier, McEliece Cryptosystem Implementation: Theory and Practice, Post-Quantum Cryptography, pp.47-62, 2008.
DOI : 10.1109/4234.823536

E. F. Brickell and A. M. Odlyzko, Cryptanalysis: a survey of recent results, Proceedings of the IEEE, vol.76, issue.5, pp.501-540, 1992.
DOI : 10.1109/5.4443

A. Canteaut, Attaques de cryptosystèmescryptosystèmes`cryptosystèmesà mots de poids faible et construction de fonctions t-résilientes, 1996.

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

A. Canteaut and N. Sendrier, Cryptanalysis of the Original McEliece Cryptosystem, Advances in Cryptology -ASIACRYPT '98, pp.187-199, 1998.
DOI : 10.1007/3-540-49649-1_16

P. Cayrel and P. Dusart, McEliece/Niederreiter PKC: Sensitivity to Fault Injection, 2010 5th International Conference on Future Information Technology, 2010.
DOI : 10.1109/FUTURETECH.2010.5482663

URL : https://hal.archives-ouvertes.fr/hal-00602197

P. Cayrel, S. Mohamed-el-yousfi-alaoui, G. Hoffmann, and P. Véron, An Improved Threshold Ring Signature Scheme Based on Error Correcting Codes, International Workshop on the Arithmetic of Finite Fields, pp.45-63, 2012.
DOI : 10.1007/978-3-642-31662-3_4

URL : https://hal.archives-ouvertes.fr/hal-00686645

P. Cayrel, P. Gaborit, and M. Girault, Identity-based identification and signature schemes using correcting codes, WCC 2007. INRIA, 2007.

P. Cayrel, P. Véron, and S. Alaoui, A Zero-Knowledge Identification Scheme Based on the q-ary Syndrome Decoding Problem, In Selected Areas in Cryptography LNCS, vol.8, issue.1, pp.171-186, 2011.
DOI : 10.1007/s002000050053

H. Chabanne and B. Courteau, Application de la méthode de décodage itérative d'omurà a la cryptanalyse du système de mc eliece, 1993.

N. Courtois, M. Finiasz, and N. Sendrier, How to Achieve a McEliece-Based Digital Signature Scheme, Advances in Cryptology -ASIACRYPT 2001, pp.157-174, 2001.
DOI : 10.1007/3-540-45682-1_10

URL : https://hal.archives-ouvertes.fr/inria-00072511

R. Crandall, Some notes on steganography, 1998.

L. Dallot, Towards a Concrete Security Proof of Courtois, Finiasz and Sendrier Signature Scheme, Lecture Notes in Computer Science, vol.4945, pp.65-77, 2008.
DOI : 10.1007/978-3-540-88353-1_6

L. Dallot and D. Vergnaud, Provably Secure Code-Based Threshold Ring Signatures, Cryptography and Coding, pp.222-235, 2009.
DOI : 10.1007/978-3-642-10868-6_13

URL : https://hal.archives-ouvertes.fr/hal-01082399

I. Damgård, A Design Principle for Hash Functions, Advances in Cryptology -CRYPTO '89, pp.416-427, 1990.
DOI : 10.1007/0-387-34805-0_39

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

R. Dowsley, J. Mller-quade, and A. Nascimento, A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model, Topics in Cryptology CT-RSA 2009, pp.240-251
DOI : 10.1109/18.850662

T. Eisenbarth, T. Gneysu, S. Heyse, and C. Paar, MicroEliece: McEliece for Embedded Devices, Cryptographic Hardware and Embedded Systems -CHES 2009, pp.49-64, 2009.
DOI : 10.1007/978-3-642-04138-9_4

S. Mohamed-el-yousfi-alaoui, P. Ozgür-dagdelen, D. Véron, P. Galindo, and . Cayrel, Extended Security Arguments for Signature Schemes, Africacrypt 2012, pp.19-34, 2012.
DOI : 10.1007/978-3-642-31410-0_2

J. Faugère, A. Otmani, L. Perret, and J. Tillich, A distinguisher for high rate mceliece cryptosystems, p.331, 2010.

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Advances in Cryptology -CRYPTO '86, pp.186-194, 1987.
DOI : 10.1007/3-540-47721-7_12

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Finiasz, Nouvelles constructions utilisant des codes correcteurs d'erreurs en cryptographiècryptographiè a clé publique, 2004.

M. Finiasz, Parallel-CFS, Proceedings of the 17th international conference on Selected areas in cryptography, SAC'10, pp.159-170, 2011.
DOI : 10.1007/3-540-45708-9_19

M. Finiasz, P. Gaborit, and N. Sendrier, Improved fast syndrome based cryptographic hash function, ECRYPT Hash Workshop, 2007.

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

J. Fischer and J. Stern, An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding, Advances in Cryptology -EUROCRYPT '96, pp.245-255, 1996.
DOI : 10.1007/3-540-68339-9_22

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

P. Fouque and G. Leurent, Cryptanalysis of a Hash Function Based on Quasi-cyclic Codes, Topics in Cryptology -CT RSA, pp.19-35, 2008.
DOI : 10.1007/978-3-540-79263-5_2

URL : https://hal.archives-ouvertes.fr/inria-00556689

J. Fridrich, Asymptotic Behavior of the ZZW Embedding Construction, IEEE Transactions on Information Forensics and Security, vol.4, issue.1, pp.151-153, 2009.
DOI : 10.1109/TIFS.2008.2011082

J. Fridrich, M. Goljan, P. Lisonek, and D. Soukal, Writing on wet paper, IEEE Transactions on Signal Processing, vol.53, issue.10, pp.3923-3935, 2005.
DOI : 10.1109/TSP.2005.855393

J. Fridrich, Steganography in Digital Media: Principles, Algorithms, and Applications, 2009.
DOI : 10.1017/CBO9781139192903

P. Gaborit, Shorter keys for code based cryptography, Proceeedings of WCC'05, pp.81-90, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00078726

P. Gaborit and M. Girault, Lightweight code-based identification and signature, 2007 IEEE International Symposium on Information Theory, 2007.
DOI : 10.1109/ISIT.2007.4557225

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

P. Gaborit, C. Laudauroux, and N. Sendrier, SYND: a Fast Code-Based Stream Cipher with a Security Reduction, 2007 IEEE International Symposium on Information Theory, 2007.
DOI : 10.1109/ISIT.2007.4557224

P. Gaborit and G. Zémor, Asymptotic improvement of the gilbert-varshamov bound for linear codes, Proceeedings of ISIT'06, pp.287-291, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00181471

R. Michael, D. S. Garey, and . Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, 1979.

V. Gauthier, U. , and G. Leander, Practical key recovery attacks on two mceliece variants. IACR Eprint archive, 2009.

J. K. Gibson, Equivalent Goppa Codes and Trapdoors to McEliece???s Public Key Cryptosystem, Advances in Cryptology -EUROCRYPT '91, pp.517-521, 1991.
DOI : 10.1007/3-540-46416-6_46

M. Girault, A (non-practical) three-pass identification protocol using coding theory, Advances in Cryptology, Auscrypt'90, pp.265-272, 1990.
DOI : 10.1007/BFb0030367

M. Girault and J. Stern, On the length of cryptographic hash-values used in identification schemes, Advances in Cryptology -CRYPTO '94, pp.202-215, 1994.
DOI : 10.1007/3-540-48658-5_21

S. Goldwasser, S. Micali, and C. Rackoff, The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computing, vol.18, issue.1, pp.186-208, 1989.
DOI : 10.1137/0218012

V. D. Goppa, A new class of linear error correcting codes, Probl. Pered. Inform, pp.24-30, 1970.

K. Lov and . Grover, A fast quantum mechanical algorithm for database search, Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, STOC '96, pp.212-219, 1996.

K. Lov and . Grover, Quantum mechanics helps in searching for a needle in a haystack, Phys. Rev. Lett, vol.79, issue.2, pp.325-328, 1997.

S. Harari, A new authentication algorithm, Coding Theory and Applications, pp.91-105, 1988.
DOI : 10.1007/BFb0019849

S. Heyse, A. Moradi, and C. Paar, Practical Power Analysis Attacks on Software Implementations of McEliece, Lecture Notes in Computer Science, vol.6061, pp.108-125, 2010.
DOI : 10.1007/978-3-642-12929-2_9

R. Housley, Using advanced encryption standard (aes) counter mode with ipsec encapsulating security payload (esp), RFC Network Working Group, vol.3686, 2004.
DOI : 10.17487/rfc3686

J. Massey, Minimal codewords and secret sharing, 6th Joint Swedish-Russian Workshop on Information Theory, pp.276-279, 1993.

T. Johansson and F. Jönsson, On the complexity of some cryptographic problems based on the general decoding problem, IEEE Transactions on Information Theory, vol.48, issue.10, pp.2669-2678, 2002.
DOI : 10.1109/TIT.2002.802608

P. 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

R. H. Yuan-xing-li, X. Deng, and W. Mei, On the equivalence of McEliece's and Niederreiter's public-key cryptosystems, IEEE Transactions on Information Theory, vol.40, issue.1, p.271, 1994.
DOI : 10.1109/18.272496

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

F. J. Macwilliams and N. J. Sloane, The Theory of Error-Correcting Code, 1977.

A. May, A. Meurer, and E. Thomae, Decoding random linear codes in o

R. J. Mceliece, A public-key cryptosystem based on algebraic coding theory, JPL DSN Progress Report, pp.114-116, 1978.

R. J. Mceliece and D. V. Sarwate, On sharing secrets and Reed-Solomon codes, Communications of the ACM, vol.24, issue.9, pp.583-584, 1981.
DOI : 10.1145/358746.358762

R. C. Merkle and M. E. Hellman, Hiding information and signatures in trapdoor knapsacks, IEEE Transactions on Information Theory, vol.24, issue.5, pp.525-530, 1978.
DOI : 10.1109/TIT.1978.1055927

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

R. Misoczki and P. 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

H. Molter, M. Stttinger, A. Shoufan, and F. Strenzke, A simple power analysis attack on a McEliece cryptoprocessor, Journal of Cryptographic Engineering, vol.26, issue.5, pp.29-36, 2011.
DOI : 10.1007/s13389-011-0001-3

C. Munuera and M. Barbier, Wet paper codes and the dual distance in steganography, Advances in Mathematics of Communications, vol.6, issue.3, pp.237-285, 2012.
DOI : 10.3934/amc.2012.6.273

URL : https://hal.archives-ouvertes.fr/inria-00584877

C. Munuera, Steganography from a coding theory point of view, volume 8 of Series on Coding Theory and Cryptology, 2013.

H. Niederreiter, Knapsack-type cryptosystems and algebraic coding theory, Problems Control Inform. Theory, vol.15, issue.2, pp.159-166, 1986.

R. Nojima, H. Imai, K. Kobara, and K. Morozov, Semantic security for the mceliece cryptosystem without random oracles. Designs, Codes and Cryptography, pp.289-305, 1007.

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

C. Peters, Information-Set Decoding for Linear Codes over F q, Proceedings Lecture Notes in Computer Science, vol.6061, pp.81-94, 2010.
DOI : 10.1007/978-3-642-12929-2_7

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

E. Prange, The use of information sets in decoding cyclic codes, IEEE Transactions on Information Theory, vol.8, issue.5, pp.85-89, 1962.
DOI : 10.1109/TIT.1962.1057777

J. Quisquater and L. Guillou, How to Explain Zero-Knowledge Protocols to Your Children, Advances in Cryptology-Crypto '89, pp.628-631, 1990.
DOI : 10.1007/0-387-34805-0_60

R. L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.26, issue.1, pp.96-99, 1983.
DOI : 10.1145/357980.358017

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

O. Markku-juhani and . Saarinen, Linearization attacks against syndrome based hashes, Proceedings of the cryptology 8th international conference on Progress in cryptology, INDOCRYPT'07, pp.1-9, 2007.

N. Sendrier, Efficient generation of binary words of given weight, Cryptography and Coding - 5th IMA Conference, pp.184-187, 1995.
DOI : 10.1007/3-540-60693-9_20

N. Sendrier, On the structure of a randomly permuted concateneted code, EUROCODE '94, pp.169-173, 1994.

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

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

A. Shamir, Identity-Based Cryptosystems and Signature Schemes, CRYPTO'84, pp.47-53, 1984.
DOI : 10.1007/3-540-39568-7_5

W. Peter and . Shor, Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer, Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pp.20-22, 1994.

A. Shoufan, F. Strenzke, H. Molter, and M. Stttinger, A Timing Attack against Patterson Algorithm in the McEliece PKC, Lecture Notes in Computer Science, vol.5984, pp.161-175, 2009.
DOI : 10.1007/978-3-642-14423-3_12

V. M. Sidelnikov and S. O. 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

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

J. Stern, A new identification scheme based on syndrome decoding, Advances in Cryptology -CRYPTO '93, pp.13-21, 1993.
DOI : 10.1007/3-540-48329-2_2

F. A. Strenzke and . Smart, A Smart Card Implementation of the McEliece PKC, Information Security Theory and Practices. Security and Privacy of Pervasive Systems and Smart Devices, pp.47-59, 2010.
DOI : 10.1007/978-3-540-88403-3_4

URL : https://hal.archives-ouvertes.fr/hal-01056067

F. Strenzke, E. Tews, H. Molter, R. Overbeck, and A. Shoufan, Side Channels in the McEliece PKC, Post-Quantum Cryptography, pp.216-229, 2008.
DOI : 10.1007/978-3-540-46588-1_10

Y. Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, Further results on Goppa codes and their applications to constructing efficient binary codes, IEEE Transactions on Information Theory, vol.22, issue.5, pp.518-526, 1976.
DOI : 10.1109/TIT.1976.1055610

J. Van and T. , On the mceliece public-key cryptosystem In Advances in Cryptology -CRYPTO '88, Lecture Notes in Computer Science, vol.403, pp.119-131, 1988.

P. Véron, Cryptanalysis of Harari's identification scheme, Cryptography and Coding, pp.264-269, 1995.
DOI : 10.1007/3-540-60693-9_28

P. Véron, Improved identification schemes based on error-correcting codes, Applicable Algebra in Engineering, Communication and Computing, vol.9, issue.1, pp.57-69, 1996.
DOI : 10.1007/s002000050053

P. Véron, PUBLIC KEY CRYPTOGRAPHY AND CODING THEORY, Selected Topics in Information and Coding Theory, 2010.
DOI : 10.1142/9789812837172_0015

D. Wagner, A Generalized Birthday Problem, Advances in Cryptology -CRYPTO '02, pp.288-304, 2002.
DOI : 10.1007/3-540-45708-9_19

A. Westfeld, F5???A Steganographic Algorithm, Information Hiding, pp.289-302, 2001.
DOI : 10.1007/3-540-45496-9_21