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

M. Barot, J. A. De, and . Pena, Estimating the size of a union of random subsets of fixed cardinality, Elemente der Mathematik, vol.56, issue.4, pp.163-169, 2001.
DOI : 10.1007/PL00000552

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

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

D. Engelbert, R. Overbeck, and A. Schmidt, A summary of McEliece-type cryptosystems and their security, Cryptology ePrint Archive, Report, vol.162, 2006.

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

G. Kabatianskii, E. Krouk, and B. J. Smeets, A digital signature scheme based on random error-correcting codes, Conf. Lecture Notes in Computer Science, vol.1355, pp.161-167, 1997.
DOI : 10.1007/BFb0024461

L. Lamport, Constructing digital signatures from a one way function, 1979.

P. J. Lee and E. F. Brickell, An Observation on the Security of McEliece???s Public-Key Cryptosystem, Lecture Notes in Computer Science, vol.330, 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

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

F. J. Macwilliams and N. J. Sloane, The theory of error-correcting codes, 1986.

R. J. Mceliece, A public-key system based on algebraic coding theory, pp.114-116, 1978.

R. C. Merkle, A Certified Digital Signature, 9th Annual International Cryptology Conference Proceedings (G. Brassard, pp.218-238, 1989.
DOI : 10.1007/0-387-34805-0_21

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

A. Perrig, The BiBa one-time signature and broadcast authentication protocol, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.28-37, 2001.
DOI : 10.1145/501983.501988

L. Reyzin and N. Reyzin, Better than BiBa: Short One-Time Signatures with Fast Signing and Verifying, ACISP Lecture Notes in Computer Science, vol.2384, pp.144-153, 2002.
DOI : 10.1007/3-540-45450-0_11
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.24.7320

J. Stern, A method for finding codewords of small weight, Lecture Notes in Computer Science, vol.388, pp.106-113, 1988.
DOI : 10.1007/BFb0019850

J. Stern, A new identification scheme based on syndrome decoding, Lecture Notes in Computer Science, vol.773, pp.13-21, 1993.
DOI : 10.1007/3-540-48329-2_2

P. Véron, Probì eme SD, opérateur trace, schémas d'identification et codes de goppa, 1995.