Résumé : The McEliece scheme is a generic frame introduced in \cite{M78}, which allows to use any error correcting code for which there exists an efficient decoding algorithm to design an encryption scheme by hiding the generator matrix of the code. Similarly, the Niederreiter frame, introduced in \cite{N86}, is the dual version of the McEliece scheme, and achieves smaller ciphertexts. In the present paper, we propose a generalization of the McEliece frame and the Niederreiter frame to matrix codes and the MinRank problem, that we apply to Gabidulin matrix codes (Gabidulin rank codes considered as matrix codes). The masking we consider consists in starting from a rank code $\mathcal C$, computing a matrix version of $\mathcal C$ and then concatenating a certain number of rows and columns to the matrix code version of the rank code $\mathcal C$ before applying an isometry for matrix codes, i.e. right and left multiplications by fixed random matrices.
Choose timezone
Your profile timezone:
