*. /. Input and *. *. , Supp the support of the GRS code */ /* B the multiplicator coefficients of the */ /* GRS code */ /* Pol the message to encode in the * The codeword of a GRS code defined by the */ /* support Supp and the multiplicator */ /* coefficients B. The returned codeword is */ /* codeword associated to polynomial Pol, p.80

.. De-krawtchouk, 13 générateur

[. Bibliographie, M. Augot, A. Barbier, and . Couvreur, List-decoding of binary Goppa codes up to the binary Johnson bound, 2010.

[. Augot, M. Barbier, and A. Couvreur, List-decoding of binary Goppa codes up to the binary Johnson bound, 2011 IEEE Information Theory Workshop, 2011.
DOI : 10.1109/ITW.2011.6089384
URL : https://hal.archives-ouvertes.fr/inria-00547106

[. Augot, M. Barbier, and C. Fontaine, Ensuring Message Embedding in Wet Paper Steganography, Liqun Chen, ´ editeur. IMA proceedings, 2011.
DOI : 10.1007/978-3-540-88961-8_5
URL : https://hal.archives-ouvertes.fr/hal-00639551

M. Alekhnovich, Linear Diophantine Equations Over Polynomials and Soft Decoding of Reed???Solomon Codes, IEEE Transactions on Information Theory, vol.51, issue.7, pp.2257-2265, 2005.
DOI : 10.1109/TIT.2005.850097

[. Agrell, A. Vardy, and K. Zeger, Upper bounds for constant-weight codes, IEEE Trans. on Information Theory, vol.46, issue.7, pp.2373-2395, 2000.

M. Barbier, New set of codes for the maximum-likelyhood decoding problem, 2010.

P. Beelen and K. Brander, Efficient list decoding of a class of algebraic-geometry codes, Advances in Mathematics of Communication, pp.485-518, 2010.

P. Beelen and K. Brander, Key equations for list decoding of Reed???Solomon codes and how to solve them, Journal of Symbolic Computation, vol.45, issue.7, pp.773-786, 2010.
DOI : 10.1016/j.jsc.2010.03.010

M. Barbier and P. Barreto, Key reduction of McEliece's cryptosystem using list decoding, 2011 IEEE International Symposium on Information Theory Proceedings, 2011.
DOI : 10.1109/ISIT.2011.6034058

E. Barker, W. Barker, W. Burr, W. Polk, and M. Smid, Recommendation for key management ? part 1 : General (revised). NIST Special Publication 800-57, pp.1-142, 2007.

[. Bose and D. Chaudhuri, On a class of error correcting binary group codes. Information and Computation/information and Control, pp.68-79, 1960.

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

[. Bosma, J. Cannon, C. Et-catherine-playoust-morgan-barbier, G. Chabot, and . Quintin, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.77-97235, 1997.
DOI : 10.1006/jsco.1996.0125

E. Berlekamp, Algebraic coding theory, 1984.
DOI : 10.1142/9407

D. Bernstein, List Decoding for Binary Goppa Codes, 2008.
DOI : 10.1109/TIT.1976.1055610

D. Bernstein, Simplified High-Speed High-Distance List Decoding for Alternant Codes, 2011.
DOI : 10.1016/0022-314X(69)90047-X

J. Bierbrauer, J. F. , Y. Shi, and ´. Editeur, Constructing Good Covering Codes for Applications in Steganography, Lecture Notes in Computer Science SIAM J. Discrete Math, vol.4920, issue.16, pp.1-22276, 2001.
DOI : 10.1007/978-3-540-69019-1_1

T. Berger, P. Loidreau, [. Bernstein, T. Lange, and C. Peters, How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography Attacking and defending the McEliece cryptosystem, Dans Johannes Buchmann, et Jintai Ding Lecture Notes in Computer Science, vol.35585, issue.5299, pp.63-79, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00068424

E. Berlekamp, R. Mceliece, N. Et-henk-van-tilborg-bhaskar-biswas, and . Sendrier, On the inherent intractability of certain coding problems McEliece cryptosystem implementation : Theory and practice, IEEE Trans. on Information Theory Lecture Notes in Computer Science, vol.5299, issue.3, pp.24384-386, 1978.

P. Cayrel, Construction et optimisation de cryptosystèmes basés sur les codes correcteurs d'erreurs, Thèse de doctorat, 2008.

A. Canteaut, M. Et-florent-chabaud-nicolas-courtois, . Finiasz, . Et-nicolas-sendrier-fengjuan, X. Chai et al., 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 How to achieve a McEliece-based digital signature scheme A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers, Advances in Cryptology ? ASIACRYPT 2001, pp.367-378, 1998.

G. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering codes de North-Holland Mathematical Library, Coo00] C. Cooper. On the rank of random matrices. Random Structures & Algorithms, pp.209-232, 1997.

R. Crandall, Some notes on Steganography, 1998. Posted on the steganography mailing list

A. Canteaut, . Et-nicolas-sendrier-ohta, . Et-dingyi-pei, M. Whitfield-diffie, and . Hellman, Advances in Cryptology ? ASIACRYPT'98, volume 1514 de Lecture Notes in Computer Science New directions in cryptography A summary of McEliece-type cryptosystems and their security, Cryptanalysis of the original McEliece cryptosystem, pp.187-199644, 1976.

C. Fontaine, [. Et-fabien-galand, M. Fridrich, P. Goljan, D. Lisonek et al., How Reed-Solomon codes can improve steganographic schemes Writing on wet paper, octobre 2005. [FGS05] Jessica Fridrich, Miroslav Goljan, et David Soukal. Efficient wet paper codes. Dans Information HidingFGS06] Jessica Fridrich, pp.1-103923, 2005.

V. Bibliographie, M. Barbier-[-fjf10-]-tomas-filler-judas, and J. Fridrich, Minimizing embedding impact in steganography using trellis-coded quantization, SPIE, vol.7541, p.754105, 2010.

[. Faugère, A. Otmani, L. Perret, J. Gilbert, and ´. Editeur, 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

. Jean-charles, A. Faugère, L. Otmani, J. Perret, and . Tillich, A distinguisher for high rate McEliece cryptosystems, Eprint Report, vol.331, 2010.

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

[. Galand and G. Kabatiansky, Information hiding by coverings, Proceedings 2003 IEEE Information Theory Workshop (Cat. No.03EX674), pp.151-154, 2003.
DOI : 10.1109/ITW.2003.1216717

V. Goppa, A New Class of Linear Error Correcting Codes, Problemy Peredachi Informatsii, vol.6, pp.24-30, 1970.

M. Grassl, Bounds on the minimum distance of linear codes and quantum codes. Online available at http ://www.codetables.de, pp.2011-2015, 2007.

[. Guruswami and M. Sudan, Improved decoding of Reed-Solomon and algebraic-geometry codes, IEEE Transactions on Information Theory, vol.45, issue.6, pp.1757-1767, 1999.
DOI : 10.1109/18.782097

[. Guruswami, List Decoding of Error-Correcting Codes : Winning Thesis of the, ACM Doctoral Dissertation Competition. Lecture Notes in Computer Science, vol.3282, 2002.
DOI : 10.1007/b104335

[. Guruswami, Algorithmic Results in List Decoding, Foundations and Trends?? in Theoretical Computer Science, vol.2, issue.2, 2006.
DOI : 10.1561/0400000007

[. Guruswami and A. Vardy, Maximum-Likelihood Decoding of Reed???Solomon Codes is NP-Hard, SODA '05 : Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms, pp.470-478, 2005.
DOI : 10.1109/TIT.2005.850102

[. Grassl and G. White, New good linear codes by special puncturings . Dans Information Theory, ISIT 2004. Proceedings. International Symposium on, p.454, 2004.
DOI : 10.1109/isit.2004.1365491

R. Hamming, The art of probability for scientists and engineers, 1994.

[. Hamilton, SINCGARS system improvement program (SIP) specific radio improvements, Proceedings of the 1996 Tactical Communications Conference. Ensuring Joint Force Superiority in the Information Age, pp.397-406, 1996.
DOI : 10.1109/TCC.1996.561109

A. Hocquenghem, Codes correcteurs d'erreurs, pp.147-156, 1959.

N. [. Hedayat, J. Sloane, and . Stufken, Orthogonal Arrays : Theory and Applications, 1999.
DOI : 10.1007/978-1-4612-1478-6

R. Jurrius and . Et-ruud-pellikaan, The extended coset leader weight enumerator, Symposium on Information Theory, p.30, 2009.

M. Keinänen, Techniques for solving boolean equation systems, Thèse de doctorat, 2006.

]. A. Ker72 and . Kerdock, A class of low-rate nonlinear binary codes, Information and Control, vol.20, issue.2, pp.182-187, 1972.

[. Koetter, On algebraic decoding of algebraic-geometric and cyclic codes, Thèse de doctorat, 1996.

[. Koetter, A. Vardy, and A. Ahmed, Efficient interpolation and factorization in algebraic soft-decision decoding of Reed-Solomon codes, Proceedings. IEEE International Symposium on, p.365, 2003.

E. [. Lee and . Brickell, An Observation on the Security of McEliece???s Public-Key Cryptosystem, Lecture Notes in Computer Science, pp.275-280, 1988.
DOI : 10.1007/3-540-45961-8_25

R. Yuan-xing-li, . Deng, M. Et-xin, and . Wang, 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.
DOI : 10.1109/18.272496

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

[. Misoczki and P. S. Barreto, Compact McEliece keys from Goppa codes. Dans Selected Areas in Cryptography ? SAC, MB11] Carlos Munuera, et Morgan Barbier. Wet paper codes and the dual distance in steganography. Advances in Mathematics of Communications, pp.276-392, 2009.
URL : https://hal.archives-ouvertes.fr/hal-00870932

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

R. Mceliece, The Guruswami-Sudan decoding algorithm for Reed- Solomon codes Rapport technique, The Interplanetary Network Progress Report 42-153, pp.42-153, 2003.

F. J. Macwilliams, N. J. , and A. Sloane, The theory of error-correcting codes. II, 1977.

[. Munuera, On the generalized Hamming weights of geometric Goppa codes, IEEE Transactions on Information Theory, vol.40, issue.6, pp.2092-2099, 1994.
DOI : 10.1109/18.340488

[. Munuera, Steganography and error-correcting codes, Signal Processing, vol.87, issue.6, pp.1528-1533, 2007.
DOI : 10.1016/j.sigpro.2006.12.008

]. J. Myk72 and . Mykkeltveit, A note on Kerdock codes. Rapport technique, Communications Systems Research Section, mars 1972

M. Nadler, A 32-point n = 12, d = 5 code. Information Theory, IRE Transactions on, vol.8, issue.1, p.58, 1962.

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

H. Orman and P. Hoffman, Determining Strengths For Public Keys Used For Exchanging Symmetric Keys. Purple Streak Development and VPN Consortium, 2004.

[. Overbeck, J. Et-nicolas-sendrier-bernstein, E. Buchmann, and ´. Dahmen, Code-based cryptography, pp.95-145, 2009.
DOI : 10.1007/978-3-540-88702-7_4

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

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

D. Pointcheval, Chosen-ciphertext security for any one-way cryptosystem . Dans Hideki Imai, et Yuliang Zheng, Public Key Cryptography , volume 1751 de Lecture Notes in Computer Science, pp.129-146, 2000.

[. Preparata, A class of optimum nonlinear double-error-correcting codes. Information and Control, pp.378-400, 1968.

R. Roth and . Et-gitit-ruckenstein, Efficient decoding of Reed-Solomon codes beyond half the minimum distance, IEEE Transactions on Information Theory, vol.46, issue.1, pp.246-257, 2000.
DOI : 10.1109/18.817522

M. Barbier, B. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM, vol.21, pp.120-126, 1978.

[. Studholme and I. Blake, Random Matrices and Codes for the Erasure Channel, Algorithmica, vol.52, issue.2, pp.605-620
DOI : 10.1007/s00453-008-9192-0

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

[. Cohen, J. Wolfmann, and ´. , A method for finding codewords of small weight, Coding Theory and Applications Lecture Notes in Computer Science, vol.388, pp.106-113, 1989.

D. Stinson, Resilient functions and large sets of orthogonal arrays, Congressus Numericus, vol.92, pp.105-110, 1993.

M. Sudan, Decoding of Reed Solomon Codes beyond the Error-Correction Bound, Journal of Complexity, vol.13, issue.1, pp.180-193, 1997.
DOI : 10.1006/jcom.1997.0439

D. Schönfeld, . Et-antje, and . Winkler, Enhancing the security of the McEliece public-key crypto system Embedding with syndrome coding based on BCH codes, Proceedings of the 8th workshop on Multimedia and security, MM&Sec '06, pp.799-812, 2000.

A. Tietäväinen, On the Nonexistence of Perfect Codes over Finite Fields, SIAM Journal on Applied Mathematics, vol.24, issue.1, pp.88-96, 1973.
DOI : 10.1137/0124010

I. Tal and R. Roth, On list decoding of alternant codes in the Hamming and Lee metrics, IEEE Trans. on Information Theory, 2003.

E. Verheul, J. Doumen, and . Et-henk-van-tilborg, Sloppy Alice attacks ! Adaptive chosen ciphertext attacks on the McEliece public-key cryptosystem. Dans Information, coding and mathematics : proceedings of workshop honoring prof. Bob McEliece on his 60th birthday, pp.99-119, 2002.

[. Van-lint, A new description of the Nadler code (Corresp.), IEEE Transactions on Information Theory, vol.18, issue.6, pp.825-826, 1972.
DOI : 10.1109/TIT.1972.1054904

[. Van-lint, Introduction to Coding Theory, 1998.

L. Welch and E. Berlekamp, Error correction for algebraic block codes, 1986.

A. Westfeld and . F5-a, Information Hiding [Wie06] Christian Wieschebrink. An attack on a modified Niederreiter encryption scheme, Lecture Notes in Computer Science Lecture Notes in Computer Science, vol.3958, pp.289-302, 2001.

[. Wu, New List Decoding Algorithms for Reed–Solomon and BCH Codes, IEEE Transactions on Information Theory, vol.54, issue.8, pp.3611-3630123, 1973.
DOI : 10.1109/TIT.2008.926355