Some new NP-complete coding problems. Probl. Peredachi Inf, pp.23-28, 1994. ,
Reducing Key Length of the McEliece Cryptosystem, AFRICACRYPT 2009, pp.77-97, 2009. ,
DOI : 10.1007/BFb0019850
URL : https://hal.archives-ouvertes.fr/hal-01081727
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
Identity-based identification and signature schemes using correcting codes, International Workshop on Coding and Cryptography, pp.69-78, 2007. ,
Secure Implementation of the Stern Authentication and Signature Schemes for Low-Resource Devices, CARDIS 2008, pp.191-205, 2008. ,
DOI : 10.1007/3-540-48329-2_2
URL : https://hal.archives-ouvertes.fr/hal-00335228
The cryptographic security of the syndrome decoding problem for rank distance codes, ASIACRYPT 1996, pp.368-381, 1996. ,
DOI : 10.1007/BFb0034862
Improved Girault identification scheme, Electronics Letters, vol.30, issue.19, pp.1590-1591, 1994. ,
DOI : 10.1049/el:19941106
Algebraic Cryptanalysis of McEliece Variants with Compact Keys, EUROCRYPT 2010, pp.279-298, 2010. ,
DOI : 10.1007/978-3-642-13190-5_14
How To Prove Yourself: Practical Solutions to Identification and Signature Problems, CRYPTO 1986, pp.186-194, 1987. ,
DOI : 10.1007/3-540-47721-7_12
Lightweight code-based authentication and signature, IEEE International Symposium on Information Theory ? ISIT 2007, pp.191-195, 2007. ,
Zero-knowledge twenty years after its invention, 2002. ,
Cryptanalysis of PKP: A New Approach, PKC 2001, pp.165-172, 1992. ,
DOI : 10.1007/3-540-44586-2_12
The theory of error correcting codes, 1977. ,
A new efficient threshold ring signature scheme based on coding theory, PQCrypto 2008, pp.1-16, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00335230
Compact McEliece Keys from Goppa Codes, SAC 2009, pp.376-392, 2009. ,
DOI : 10.1007/978-3-642-05445-7_24
URL : https://hal.archives-ouvertes.fr/hal-00870932
On lower bounds for information set decoding over Fq, p.2010, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-01382959
Information-set decoding for linear codes over Fq, 2009. ,
DOI : 10.1007/978-3-642-12929-2_7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.182.8991
Limit distribution of the minimum distance of random linear codes, IEEE Transactions on Information Theory, vol.13, issue.4, pp.595-599, 1967. ,
DOI : 10.1109/TIT.1967.1054053
A New Identification Scheme Based on the Perceptrons Problem, EUROCRYPT 1994, pp.319-328, 1995. ,
DOI : 10.1007/3-540-49264-X_26
A new NP-complete problem and public-key identification, Designs, Codes and Cryptography, vol.28, issue.1, pp.5-31, 2003. ,
DOI : 10.1023/A:1021835718426
A realistic security analysis of identification schemes based on combinatorial problems, European Transactions on Telecommunications, vol.5, issue.5, pp.471-480, 1997. ,
DOI : 10.1002/ett.4460080505
An efficient identification scheme based on permuted kernels, CRYPTO 1989, pp.606-609, 1990. ,
DOI : 10.1007/0-387-34805-0_54
A method for finding codewords of small weight, Theory 1988, pp.106-113, 1989. ,
DOI : 10.1007/BFb0019850
A new identification scheme based on syndrome decoding, CRYPTO 1993, pp.13-21, 1994. ,
DOI : 10.1007/3-540-48329-2_2
Designing Identification Schemes with Keys of Short Size, CRYPTO 1994, pp.164-173, 1994. ,
DOI : 10.1007/3-540-48658-5_18
Practical key recovery attacks on two McEliece variants, 2009. ,
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
MQ * -ip: An identity-based identification scheme without number-theoric assumptions, 2010. ,