T. P. Berger and P. Loidreau, How to Mask the Structure of Codes for a Cryptographic use. Designs, Codes and Cryptography, pp.63-79, 2005.
URL : https://hal.archives-ouvertes.fr/hal-00068424

T. G. Berry, Construction of Linear Systems on Hyperelliptic Curves, Journal of Symbolic Computation, vol.26, issue.3, pp.315-327, 1998.
DOI : 10.1006/jsco.1998.0214

B. Biswas and N. Sendrier, McEliece Cryptosystem Implementation: Theory and Practice, Post-Quantum Cryptography, number 5299 in LNCS, pp.47-62, 2008.
DOI : 10.1109/4234.823536

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, number 1514 in LNCS, pp.187-199, 1998.
DOI : 10.1007/3-540-49649-1_16

D. G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation, vol.48, issue.177, pp.95-101, 1987.
DOI : 10.1090/S0025-5718-1987-0866101-0

H. Cohen, A Course in Computational Algebraic Number Theory, 1993.
DOI : 10.1007/978-3-662-02945-9

H. Cohen and G. Frey, Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2005.
DOI : 10.1201/9781420034981

J. S. Coron, Cryptanalysis of a Public-Key Encryption Scheme Based on the Polynomial Reconstruction Problem, Proceedings of the 7th International Workshop on Theory and Practice in Public Key Cryptography, PKC2004, LNCS, pp.14-28, 2004.
DOI : 10.1007/978-3-540-24632-9_2

C. Faure, Cryptosystèmè a Clé Publique Fondé sur leProbì eme de Reconstruction de Polynômes Linéaires. Journées " Codage et Cryptographie Aussois, 2005.

C. Faure, Average Number of Gabidulin Codewords Within a Sphere, Proceedings of the 10th international workshop on Algebraic and Combinatorial Coding Theory, ACCT 2006, pp.86-89, 2006.

C. Faure, Nombre Moyen de Mots de code de GabidulinàGabidulinà l'Intérieur d'une Boule. Journées " Codage et Cryptographie, 2006.

C. Faure, Cryptanalysis of the McEliece Cryptosystem over Hyperelliptic Codes, Proceedings of the 11th international workshop on Algebraic and Combinatorial Coding Theory, pp.99-107, 2008.

C. Faure and P. Loidreau, A New Public-Key Cryptosystem Based on the Problem of Reconstructing p???Polynomials, Proceedings of the 4th International workshop on Coding and Cryptography, WCC 2005, pp.275-284, 2005.
DOI : 10.1007/11779360_24
URL : https://hal.archives-ouvertes.fr/hal-00459607

C. Faure and P. Loidreau, A New Public-Key Cryptosystem Based on the Problem of Reconstructing p???Polynomials, pp.304-315, 2006.
DOI : 10.1007/11779360_24
URL : https://hal.archives-ouvertes.fr/hal-00459607

G. Feng and T. R. Rao, Decoding algebraic-geometric codes up to the designed minimum distance, IEEE Transactions on Information Theory, vol.39, issue.1, pp.37-45, 1993.
DOI : 10.1109/18.179340

M. Finiasz, Nouvelles Constructions utilisant des Codes Correcteurs d'Erreurs en Cryptographiè a Clef Publique, 2004.

W. Fulton, Algebraic Curves : An Introduction to Algebraic Geometry Disponible en ligne, 1974.

E. M. Gabidulin, Theory of Codes with Maximal Rank Distance. Problems of Information Transmission, pp.1-12, 1985.

E. M. Gabidulin and A. V. Ourivski, Modified GPT PKC with Right Scrambler, Proceedings of the 2nd International workshop on Coding and Cryptography, pp.233-242, 2001.
DOI : 10.1016/S1571-0653(04)00168-4

E. M. Gabidulin, A. V. Paramonov, and O. V. Tretjakov, Ideals over a Non-Commutative Ring and their Application in Cryptology, LNCS, vol.573, pp.482-489, 1991.
DOI : 10.1007/3-540-46416-6_41

J. K. Gibson, Severely Denting the Gabidulin Version of the McEliece Public-Key Cryptosystem. Designs, Codes and Cryptography, pp.37-45, 1995.

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

H. Janwa and O. Moreno, Public Key Cryptosystems Using Algebraic- Geometric Codes. Designs, Codes and Cryptography, 1996.

Y. X. Li, R. H. Deng, and X. M. 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.

P. Loidreau, Métrique Rang et Cryptographie Mémoire d'habilitationà habilitationà diriger les recherches, 2007.

J. L. Massey, Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969.
DOI : 10.1109/TIT.1969.1054260

R. J. Mceliece, A public-key Cryptosystem based on Algebraic Coding Theory, Jet Propulsion Lab. DSN Progress Report, 1978.

L. Minder, Cryptography based on Error Correcting Codes, 2007.

H. Niederreiter, Knapsack-type Cryptosystems and Algebraic Coding Theory. Problems of Control and Information Theory, 35] ¨ O. Ore. Contribution to the theory of finite fields. Transactions of the, pp.159-166559, 1933.

A. Ourivski and T. Johannson, New Technique for Decoding Codes in the Rank Metric and Its Cryptography Applications. Problems of Information Transmission, pp.237-246, 2002.

A. V. Ourivski, E. M. Gabidulin, B. Honary, and B. Ammar, Reducible rank codes and their applications to cryptography, IEEE Transactions on Information Theory, vol.49, issue.12, pp.3289-3293, 2003.

R. Overbeck, S. Sakata, H. E. Jensen, and T. Høholdt, Structural Attacks for Public Key Cryptosystems based??on Gabidulin Codes, Journal of Cryptology, vol.42, issue.44, pp.280-301, 1995.
DOI : 10.1007/s00145-007-9003-9

N. Sendrier, On the Structure of a Randomly Permuted Concatenated Code, Proceedings of EUROCODE 94, pp.169-173, 1994.

C. E. Shannon, Communication Theory of Secrecy Systems. Bell system technical journal, pp.656-715, 1949.

M. A. Shokrollahi and H. Wasserman, Decoding algebraic-geometric codes beyond the error-correction bound, Proceedings of the thirtieth annual ACM symposium on Theory of computing , STOC '98, pp.241-248, 1998.
DOI : 10.1145/276698.276753

V. M. Sidel-'nikov and S. O. Shestakov, On cryptosystems based on generalized Reed-Solomon codes, Discrete Mathematics, vol.4, issue.3, pp.57-63, 1992.

D. Silva, F. R. Kschischang, and R. Koetter, A Rank-Metric Approach to Error Control in Random Network Coding, IEEE Transactions on Information Theory, vol.54, issue.9, pp.3951-3967, 2008.
DOI : 10.1109/TIT.2008.928291

J. H. Silverman, The Arithmetic of Elliptic Curves, 1986.

J. Stern, A method for finding codewords of small weight, Coding theory and applications, number 388 in LNCS, pp.106-113, 1989.
DOI : 10.1007/BFb0019850

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

N. Silberstein and T. Etzion, Error-Correcting Codes in Projective Spaces via Rank-Metric Codes and Ferrers Diagrams. preprint

M. Tsfasman, S. Vladut, and D. Nogin, Algebraic Geometric Codes : Basic Notions, 2007.
DOI : 10.1090/surv/139