1.
M. Albrecht, D. J. Bernstein, T. Chou, C. Cid, J. Gilcher, T. Lange, V. Maram, I. von Maurich, R. Mizoczki, R. Niederhagen, Ed. Persichetti, K. Paterson, C. Peters, P. Schwabe, N. Sendrier, J. Szefer, C. J. Tjhai, M. Tomlinson and W. Wen, Classic McEliece (merger of Classic McEliece and NTS-KEM), https://classic.mceliece.org, November 2022. Fourth round finalist of the NIST post-quantum cryptography call.
2. Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes
3.
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, in Advances in Cryptology - EUROCRYPT 2012, LNCS. Springer, 7237 (2012), 520-536.
4.
D. J. Bernstein, Grover vs. McEliece, in Nicolas Sendrier, editor, Post-Quantum Cryptography 2010, LNCS, Springer, 6061 (2010), 73-80.
5.
L. Both and A. May, Optimizing BJMM with nearest neighbors: Full decoding in $2^{2/21 n}$ and McEliece security, in WCC Workshop on Coding and Cryptography, 2017.