M. Bellare and P. Rogaway, Random oracles are practical, Proceedings of the 1st ACM conference on Computer and communications security , CCS '93, pp.62-73, 1993.
DOI : 10.1145/168588.168596

E. R. Berlekamp, Algebraic Coding Theory, 1968.
DOI : 10.1142/9407

E. R. Berlekamp, R. J. Mc-eliece, 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

E. R. Berlekamp, Bit-serial Reed - Solomon encoders, IEEE Transactions on Information Theory, vol.28, issue.6, pp.869-874, 1982.
DOI : 10.1109/TIT.1982.1056591

A. Canteaut and H. Chabanne, A further improvement of the workfactor in an attempt at breaking Mc Eliece's cryptosystem, Proceedings of Eurocode'94, pp.163-167

F. Chabaud, On the security of some cryptosystems based on error-correcting codes, Lecture Notes in Computer Science, vol.950, pp.131-139, 1995.
DOI : 10.1007/BFb0053430

A. Fiat and A. Shamir, How To Prove Yourself: Practical Solutions to Identification and Signature Problems, Lecture Notes in Computer Science, vol.263, issue.86, pp.186-194
DOI : 10.1007/3-540-47721-7_12

U. Feige, A. Fiat, and A. Shamir, Zero-knowledge proofs of identify, Proc. 19th ACM Symp. Theory of Computing, pp.210-217, 1987.

M. Girault, A (non-practical) three-pass identification protocol using coding theory, Lecture Notes in Computer Science, vol.453, pp.265-272
DOI : 10.1007/BFb0030367

M. Girault and J. Stern, On the length of cryptographic hash-values used in identification schemes, Lecture Notes in Computer Science, vol.839, 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, Proc. 17th ACM Symp. Theory Computing, pp.291-304, 1985.

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

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.34-1354
DOI : 10.1109/18.21270

F. J. Macwilliams and N. J. Sloane, The Theory of error-correcting codes, North-Holland, 1977.

D. Pointcheval, Neural Networks and their cryptographic applications, Proc. Eurocode'94, pp.183-193

A. Shamir, An Efficient Identification Scheme Based on Permuted Kernels (extended abstract), Proc. Crypto'89, pp.606-609
DOI : 10.1007/0-387-34805-0_54

J. Stern, An alternative to the Fiat-Shamir protocol, Lecture Notes in Computer Science, vol.434, pp.173-180
DOI : 10.1007/3-540-46885-4_19

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

J. Stern, Designing Identification Schemes with Keys of Short Size, Lecture Notes in Computer Science, vol.839, pp.164-173, 1994.
DOI : 10.1007/3-540-48658-5_18

N. Zierler, On the theorem of Gleason and Marsh, Proceedings of the American Mathematical Society, vol.9, issue.2, pp.236-237, 1958.
DOI : 10.1090/S0002-9939-1958-0094332-2