P. Abb-+-17]-nicolas-aragon, S. Barreto, L. Bettaieb, O. Bidoux, J. Blazy et al., , 2017.

C. Acp-+-17]-martin-albrecht, K. G. Cid, C. J. Paterson, M. Tjhai, and . Tomlinson, NTS-KEM. first round submission to the NIST post-quantum cryptography call, 2017.

N. Amab-+-17]-carlos-aguilar-melchor, S. Aragon, L. Bettaieb, O. Bidoux, J. Blazy et al., Philippe Gaborit, Edoardo Persichetti, and Gilles Zémor. HQC, December 2017. NIST Round 1 submission for Post-Quantum Cryptography

A. Marco-baldi, F. Barenghi, G. Chiaraluce, P. Pelosi, and . Santini, LEDAcrypt. second round submission to the NIST post-quantum cryptography call, 2019.

A. Becker, J. Coron, and A. Joux, Improved generic algorithms for hard knapsacks, Advances in Cryptology -EUROCRYPT 2011 -30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.364-385, 2011.
URL : https://hal.archives-ouvertes.fr/hal-00664332

D. J. Bernstein, T. Chou, T. Lange, R. Ingo-von-maurich, E. Niederhagen et al., Classic McEliece: conservative code-based cryptography, 2017.

A. Becker, A. Joux, A. May, and A. Meurer, Decoding random binary linear codes in 2 n/20 : How 1 + 1 = 0 improves information set decoding, Advances in Cryptology -EUROCRYPT 2012, 2012.

E. Berlekamp, R. Mceliece, and H. Van-tilborg, On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, vol.24, issue.3, pp.384-386, 1978.

M. Chaimovich, G. Freiman, and Z. Galil, Solving dense subset-sum problems by using analytical number theory, J. Complexity, vol.5, issue.3, pp.271-282, 1989.

N. Courtois, M. Finiasz, and N. Sendrier, How to achieve a McEliece-based digital signature scheme, Advances in Cryptology -ASIACRYPT, vol.2248, pp.157-174, 2001.
URL : https://hal.archives-ouvertes.fr/inria-00072511

T. John, R. Coffey, and . Goodman, The complexity of information set decoding, IEEE Transactions on Information Theory, vol.36, issue.5, pp.1031-1037, 1990.

R. Torres, Asymptotic analysis of ISD algorithms for the q?ary case, Proceedings of the Tenth International Workshop on Coding and Cryptography WCC 2017, 2017.

T. Debris-alazard, N. Sendrier, and J. Tillich, Surf: a new code-based signature scheme, 2017.

T. Debris-alazard, N. Sendrier, and J. Tillich, Wave: A new code-based signature scheme, Cryptology ePrint Archive, vol.996, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01958175

I. Dumer, On minimum distance decoding of linear codes, Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, pp.50-52, 1991.

A. Flaxman and B. Przydatek, Solving medium-density subset sum problems in expected polynomial time, STACS 2005, 22nd Annual Symposium on Theoretical Aspects of Computer Science, pp.305-314, 2005.

J. Cheikh-thiécoumba-gueye, S. Belo-klamti, and . Hirose, Generalization of BJMM-ISD using may-ozerov nearest neighbor algorithm over an arbitrary finite field \mathbb f q, Codes, Cryptology and Information Security -Second International Conference, C2SI 2017, pp.96-109, 2017.

Z. Galil and O. Margalit, An almost linear-time algorithm for the dense subset-sum problem, SIAM J. Comput, vol.20, issue.6, pp.1157-1189, 1991.

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the fortieth annual ACM symposium on Theory of computing, pp.197-206, 2008.

S. Hirose, May-ozerov algorithm for nearest-neighbor problem over q and its application to information set decoding, Innovative Security Solutions for Information Technology and Communications -9th International Conference, SECITC 2016, pp.115-126, 2016.

N. Howgrave, -. Graham, A. Interlando, K. Khathuria, N. Rohrer et al., New generic algorithms for hard knapsacks, Generalization of the ball-collision algorithm, vol.6110, 2010.

T. Johansson and F. Jönsson, On the complexity of some cryptographic problems based on the general decoding problem, IEEE Trans. Inform. Theory, vol.48, issue.10, pp.2669-2678, 2002.

V. Lyubashevsky, On random high density subset sums, Electronic Colloquium on Computational Complexity (ECCC), vol.1, issue.007, 2005.

R. J. Mceliece, A Public-Key System Based on Algebraic Coding Theory, pp.114-116, 1978.

A. Meurer, A Coding-Theoretic Approach to Cryptanalysis, 2017.

A. May, A. Meurer, and E. Thomae, Decoding random linear codes in O(2 0.054n ), Advances in Cryptology -ASIACRYPT 2011, vol.7073, pp.107-124, 2011.

R. Misoczki, J. Tillich, N. Sendrier, and P. S. Barreto, MDPC-McEliece: New McEliece variants from moderate density parity-check codes. IACR Cryptology ePrint Archive, 2012.
URL : https://hal.archives-ouvertes.fr/hal-00870929

C. Peters, Information-set decoding for linear codes over Fq, Post-Quantum Cryptography, vol.6061, pp.81-94, 2010.

E. Prange, The use of information sets in decoding cyclic codes, IRE Transactions on Information Theory, vol.8, issue.5, pp.5-9, 1962.

N. Sendrier, Decoding one out of many, Post-Quantum Cryptography, vol.7071, pp.51-67, 2011.

D. Wagner, A generalized birthday problem, Advances in Cryptology -CRYPTO 2002, vol.2442, pp.288-303, 2002.