Random codes: minimum distances and error exponents, IEEE Transactions on Information Theory, vol.48, issue.9, pp.2568-2573, 2002. ,
DOI : 10.1109/TIT.2002.800480
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.118.7134
Smaller Decoding Exponents: Ball-Collision Decoding, Proceedings of Crypto 2011, 2011. ,
DOI : 10.1007/978-3-642-22792-9_42
URL : http://repository.tue.nl/714848
One-time signature scheme from syndrome decoding over generic error-correcting codes, Journal of Systems and Software, vol.84, issue.2, pp.198-204, 2011. ,
DOI : 10.1016/j.jss.2010.09.016
How to Achieve a McEliece-Based Digital Signature Scheme, Com74] L. Comtet. Advanced Combinatorics. Reidel, pp.157-174, 1974. ,
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511
On Kabatianskii-Krouk-Smeets Signatures, Proceedings of the first International Workshop on the Arithmetic of Finite Fields, pp.237-251217, 1997. ,
DOI : 10.1007/978-3-540-73074-3_18
URL : https://hal.archives-ouvertes.fr/hal-00259021
On minimum distance decoding of linear codes, Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, pp.50-52, 1991. ,
Suboptimal decoding of linear codes : partition techniques, IEEE Transactions on Information Theory, vol.42, issue.6, pp.1971-1986, 1996. ,
A distinguisher for high rate McEliece cryptosystems. Cryptology ePrint Archive Security bounds for the design of code-based cryptosystems, LNCS, vol.10331, issue.5912, pp.88-105, 2009. ,
A digital signature scheme based on random errorcorrecting codes, Proceedings of the 6th IMA International Conference on Cryptography and Coding, pp.161-167, 1997. ,
Error Correcting Coding and Security for Data Networks: Analysis of the Superchannel Concept The Theory of Error-Correcting Codes A method for finding codewords of small weight, Sen11] N. Sendrier. Decoding one out of many Coding Theory and Applications, pp.106-113, 1986. ,
DOI : 10.1002/0470867574