A New Efficient Threshold Ring Signature Scheme Based on Coding Theory, Post-Quantum Cryptography, pp.1-16, 2008. ,
DOI : 10.1007/3-540-36178-2
URL : https://hal.archives-ouvertes.fr/hal-00335230
List-decoding of binary Goppa codes up to the binary Johnson bound, 2011 IEEE Information Theory Workshop, 2010. ,
DOI : 10.1109/ITW.2011.6089384
URL : https://hal.archives-ouvertes.fr/inria-00547106
Recommendation for key management part 1: General (revised) ,
Reducing Key Length of the McEliece Cryptosystem, Progress in Cryptology AFRICACRYPT 2009, pp.77-97, 2009. ,
DOI : 10.1007/BFb0019850
URL : https://hal.archives-ouvertes.fr/hal-01081727
How to mask the structure of codes for a cryptographic use. Designs, Codes and Cryptography, pp.63-79, 2005. ,
On the inherent intractability of certain coding problems. Information Theory, IEEE Transactions on, vol.24, issue.3, pp.384-386, 1978. ,
Algebraic coding theory, 1984. ,
DOI : 10.1142/9407
List Decoding for Binary Goppa Codes, 2008. ,
DOI : 10.1109/TIT.1976.1055610
Attacking and Defending the McEliece Cryptosystem, Post-Quantum Cryptography, pp.31-46, 2008. ,
DOI : 10.1007/0-387-34799-2_10
Explicit bounds for generic decoding algorithms for code-based cryptography, pp.168-180, 2009. ,
A Summary of McEliece-Type Cryptosystems and their Security, Journal of Mathematical Cryptology, vol.1, issue.2, 2006. ,
DOI : 10.1515/JMC.2007.009
Algebraic Cryptanalysis of McEliece Variants with Compact Keys, Advances in Cryptology EUROCRYPT 2010, pp.279-298, 2010. ,
DOI : 10.1007/978-3-642-13190-5_14
Security Bounds for the Design of Code-Based Cryptosystems, Advances in Cryptology ASIACRYPT 2009, pp.88-105, 2009. ,
DOI : 10.1007/978-3-642-10366-7_6
Improved decoding of Reed- Solomon and algebraic-geometry codes. Information Theory, IEEE transactions on, vol.45, issue.6, pp.1757-1767, 1999. ,
On the equivalence of McEliece's and Niederreiter's public-key cryptosystems. Information Theory, IEEE Transactions on, vol.40, issue.1, pp.271-273, 1994. ,
The theory of error-correcting codes. II, 1977. ,
A public-key cryptosystem based on algebraic coding theory, Deep Space Network Progress Report, vol.44, pp.114-116, 1978. ,
Compact McEliece Keys from Goppa Codes, Cryptology ePrint Archive Report, vol.187, 2009. ,
DOI : 10.1007/978-3-642-05445-7_24
URL : https://hal.archives-ouvertes.fr/hal-00870932
Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, pp.15159-166, 1986. ,
Determining Strengths For Public Keys Used For Exchanging Symmetric Keys. Purple Streak Development and VPN Consortium, 2004. ,
Cryptanalysis of Two McEliece Cryptosystems Based on Quasi-Cyclic Codes, Mathematics in Computer Science, vol.1, issue.4, pp.129-140, 2010. ,
DOI : 10.1007/s11786-009-0015-8
URL : https://hal.archives-ouvertes.fr/hal-01083566
Code-based cryptography, Post- Quantum Cryptography, pp.95-145, 2009. ,
DOI : 10.1007/978-3-540-88702-7_4
The algebraic decoding of Goppa codes Information Theory, IEEE Transactions on, vol.21, issue.2, pp.203-207, 1975. ,
Chosen-Ciphertext Security for Any One-Way Cryptosystem, Public Key Cryptography, pp.129-146, 2000. ,
DOI : 10.1007/978-3-540-46588-1_10
A method for finding codewords of small weight, Coding Theory and Applications, pp.106-113, 1989. ,
DOI : 10.1007/BFb0019850
Sloppy Alice attacks! Adaptive chosen ciphertext attacks on the McEliece Public-Key Cryptosystem, Information, coding and mathematics: proceedings of workshop ,
DOI : 10.1007/978-1-4757-3585-7_7