Enhanced public key security for the McEliece cryptosystem. submitted, 2011. ,
A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes, Security and Cryptography for Networks (SCN), pp.246-262, 2008. ,
DOI : 10.1007/978-3-540-85855-3_17
Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes, 2007 IEEE International Symposium on Information Theory, pp.2591-2595, 2007. ,
DOI : 10.1109/ISIT.2007.4557609
M4RI(e)-Linear Algebra over F 2 (and F 2 e ) Free Open Source Software ,
Transitions : Recommendation for transitioning the use of cryptographic algorithms and key lengths, 2011. ,
DOI : 10.6028/NIST.SP.800-131a
The representation technique -Applications to hard problems in cryptography, Thèse de doctorat, 2012. ,
Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, Advances in Cryptology - EUROCRYPT 2012, pp.520-536, 2012. ,
DOI : 10.1007/978-3-642-29011-4_31
Decoding Random Binary Linear Codes in 2 n/20: How 1???+???1???=???0 Improves Information Set Decoding, Eurocrypt 2012, 2012. ,
DOI : 10.1007/978-3-642-29011-4_31
Reducing Key Length of the McEliece Cryptosystem, Progress in Cryptology -Second International Conference on Cryptology in Africa, 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. ,
URL : https://hal.archives-ouvertes.fr/hal-00068424
Algebraic Coding Theory, 1968. ,
DOI : 10.1142/9407
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
Minimum number of bit operations for multiplication, 2009. ,
Attacking and Defending the McEliece Cryptosystem, PQCrypto, pp.31-46, 2008. ,
DOI : 10.1007/0-387-34799-2_10
Smaller Decoding Exponents: Ball-Collision Decoding, Proceedings of Crypto 2011, pp.743-760, 2011. ,
DOI : 10.1007/978-3-642-22792-9_42
Wild McEliece Incognito, PQCrypto, pp.244-254, 2011. ,
DOI : 10.1109/TIT.1976.1055610
FPGA Implementation of a Recently Published Signature Scheme, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00077045
Efficient Root Finding of Polynomials over Fields of Characteristic 2, WEWoRC 2009, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00626997
Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970. ,
DOI : 10.1145/362686.362692
How to Achieve a McEliece-Based Digital Signature Scheme, Advances in Cryptology ? Asia- crypt'2001, pp.157-174, 2001. ,
DOI : 10.1007/3-540-45682-1_10
URL : https://hal.archives-ouvertes.fr/inria-00072511
How to achieve a McEliecebased Digital Signature Scheme, Advances in Cryptology -ASIACRYPT 2001, pp.157-174 ,
URL : https://hal.archives-ouvertes.fr/inria-00072511
Distinguisher-based attacks on public-key cryptosystems using Reed???Solomon codes, Proceedings of WCC 2013, 2013. ,
DOI : 10.1007/s10623-014-9967-z
URL : https://hal.archives-ouvertes.fr/hal-00830594
New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976. ,
DOI : 10.1109/TIT.1976.1055638
On minimum distance decoding of linear codes, Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, pp.50-52, 1991. ,
On Minimum Distance Decoding of Linear Codes, Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, pp.50-52, 1991. ,
A Distinguisher for High Rate McEliece Cryptosystems, ITW 2011, pp.282-286, 2011. ,
A Distinguisher for High Rate McEliece Cryptosystems, Proceedings of the Information Theory Workshop, pp.282-286, 2011. ,
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
Cryptanalysis of the McEliece cryptosystem over hyperelliptic curves, Proceedings of the eleventh International Workshop on Algebraic and Combinatorial Coding Theory, pp.99-107, 2008. ,
Parallel-CFS, Selected Areas in Cryptography, pp.159-170, 2010. ,
DOI : 10.1007/3-540-45708-9_19
Security Bounds for the Design of Codebased Cryptosystems, Advances in Cryptology -ASIACRYPT 2009, pp.88-105, 2009. ,
A Distinguisher-Based Attack on a Variant of McEliece's Cryptosystem Based on Reed-Solomon Codes, 1204. ,
New Generic Algorithms for Hard Knapsacks, Advances in Cryptology -EURO- CRYPT 2010, pp.235-256, 2010. ,
DOI : 10.1007/978-3-642-13190-5_12
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.5474
McEliece Public Key Cryptosystems Using Algebraic-Geometric Codes. Designs Codes and Cryptography, 37] T. Johansson and F. Jönsson. On the Complexity of Some Cryptographic Problems Based on the General Decoding Problem, pp.293-307, 1996. ,
Algorithmic Cryptanalysis. Chapman & Hall/CRC Cryptography and Network Security Series, 2009. ,
A digital signature scheme based on random error-correcting codes, IMA Int. Conf., volume 1355 of Lecture Notes in Computer Science, pp.161-167, 1997. ,
DOI : 10.1007/BFb0024461
Digital signature algorithm. US patent 5231668 [41] G. Landais. Implementation of several CSD sol- ving algorithms. Free Open Source Software. https, 1991. ,
McEliece based si- gnature scheme. Free Open Source Software. https://gforge.inria.fr/projects/cfs-signature ,
Implementing CFS, Indocrypt 2012, pp.474-488, 2012. ,
DOI : 10.1007/978-3-642-34931-7_27
URL : https://hal.archives-ouvertes.fr/hal-00880644
An Efficient Attack of a McEliece Cryptosystem Variant Based on Convolutional Codes, Proceedings of PQCrypto 2013 ,
DOI : 10.1007/978-3-642-38616-9_7
URL : https://hal.archives-ouvertes.fr/hal-00880654
An Observation on the Security of McEliece???s Public-Key Cryptosystem, Advances in Cryptology -EUROCRYPT '88, pp.275-280, 1988. ,
DOI : 10.1007/3-540-45961-8_25
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
A New Version of McEliece PKC Based on Convolutional Codes, ICICS, pp.461-470, 2012. ,
DOI : 10.1007/978-3-642-34129-8_45
Shift-register synthesis and BCH decoding, IEEE Transactions on Information Theory, vol.15, issue.1, pp.122-127, 1969. ,
DOI : 10.1109/TIT.1969.1054260
Decoding random linear codes in O(2 0.054n ), LNCS, vol.7073, pp.107-124, 2011. ,
A public-key cryptosystem based on algebraic coding theory, DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol, pp.114-116, 1978. ,
A Public-Key System Based on Algebraic Coding Theory, pp.114-116, 1978. ,
Cryptanalysis of the Sidelnikov Cryptosystem, Eurocrypt, pp.347-360, 2007. ,
DOI : 10.1007/978-3-540-72540-4_20
Compact McEliece Keys from Goppa Codes, Selected Areas in Cryptography, 2009. ,
DOI : 10.1007/978-3-642-05445-7_24
URL : https://hal.archives-ouvertes.fr/hal-00870932
MDPC-McEliece: New McEliece variants from Moderate Density Parity-Check codes, 2013 IEEE International Symposium on Information Theory, p.409, 2012. ,
DOI : 10.1109/ISIT.2013.6620590
URL : https://hal.archives-ouvertes.fr/hal-00870929
Cachegrind : a cache and branch-prediction profiler, 2002. ,
Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory, pp.159-166, 1986. ,
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
An Efficient Attack on All Concrete KKS Proposals, LNCS, vol.42, issue.6, pp.98-116, 2011. ,
DOI : 10.1007/BFb0019850
URL : https://hal.archives-ouvertes.fr/hal-00913500
Public Key Cryptography based on Coding Theory, 2007. ,
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, IEEE Transactions on Information Theory, vol.21, issue.2, pp.203-207, 1975. ,
DOI : 10.1109/TIT.1975.1055350
The use of information sets in decoding cyclic codes, IEEE Transactions on Information Theory, vol.8, issue.5, pp.5-9, 1962. ,
DOI : 10.1109/TIT.1962.1057777
A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978. ,
DOI : 10.1145/359340.359342
Finding the permutation between equivalent linear codes: the support splitting algorithm, IEEE Transactions on Information Theory, vol.46, issue.4, pp.1193-1203, 2000. ,
DOI : 10.1109/18.850662
Decoding One Out of Many Shor. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer, PQ- Crypto 2011, pp.51-671484, 1997. ,
A public-key cryptosystem based on binary Reed-Muller codes, Discrete Mathematics and Applications, vol.4, issue.3, pp.191-207, 1994. ,
DOI : 10.1515/dma.1994.4.3.191
On insecurity of cryptosystems based on generalized Reed-Solomon codes, Discrete Mathematics and Applications, vol.2, issue.4, pp.439-444, 1992. ,
DOI : 10.1515/dma.1992.2.4.439
A method for finding codewords of small weight, Coding theory and applications, pp.106-113, 1989. ,
DOI : 10.1007/BFb0019850
Practical Key Recovery Attacks On Two McEliece Variants, 2009. ,
A Generalized Birthday Problem Advances in Cryptology -CRYPTO, LNCS, vol.2442, pp.288-303, 2002. ,
On the generalized Hamming weights of product codes, IEEE Transactions on Information Theory, vol.39, issue.5, pp.1709-1713, 1993. ,
DOI : 10.1109/18.259662
Two NP-complete Problems in Coding Theory with an Application in Code Based Cryptography, 2006 IEEE International Symposium on Information Theory, pp.1733-1737, 2006. ,
DOI : 10.1109/ISIT.2006.261651
Cryptanalysis of the Niederreiter Public Key Scheme Based on GRS Subcodes, PQCrypto, pp.61-72, 2010. ,
DOI : 10.1007/978-3-642-12929-2_5