J. Daniel, J. Bernstein, and . Buchmann, Post-Quantum Cryptography, 2009.

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.

P. Delsarte, Bilinear forms over a finite field, with applications to coding theory, J. Comb. Theory, Ser. A, vol.25, issue.3, pp.226-241, 1978.

E. Mukhamedovich-gabidulin, Theory of codes with maximum rank distance, Problemy Peredachi Informatsii, vol.21, issue.1, pp.3-16, 1985.

D. Gligoroski and K. Gjøsteen, Edon-k. first round submission to the NIST post-quantum cryptography call, 2017.

P. Gaborit, G. Murat, O. Ruatta, and G. Zémor, Low rank parity check codes and their application to cryptography, Proceedings of the Workshop on Coding and Cryptography WCC'2013, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00913719

P. Gaborit, O. Ruatta, and J. Schrek, On the complexity of the rank syndrome decoding problem, IEEE Trans. Information Theory, vol.62, issue.2, pp.1006-1019, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01280904

. Loo-keng and . Hua, A theorem on matrices over a sfield and its applications, J. Chinese Math. Soc, vol.1, issue.2, pp.109-163, 1951.

M. Lequesne and J. Tillich, Attack on the Edon-K key encapsulation mechanism, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01925323

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

W. Peter and . Shor, Algorithms for quantum computation: Discrete logarithms and factoring, pp.124-134, 1994.