1 citations · 1 across the 3 of their papers we have counts for
5 papers
Code distances of matrix rank-metric codes under Add-and-Remove transformations
Gianira N. Alfarano, Rakhi Pratihar, Adrien Vinçotte
For a matrix rank-metric code and an integer , the -th subcode distance of is the largest minimum rank distance of an -dimensional subcode of $…
How to break the Miranda signature scheme over matrix Gabidulin codes
Adrien Vinçotte
The Miranda signature scheme relies on masking a matrix code which disposes of a masked underlying structure, and the knowledge of which allows for efficient error decoding. We con…
MIRANDA: short signatures from a leakage-free full-domain-hash scheme
Alain Couvreur, Thomas Debris-Alazard, Philippe Gaborit +1
We present , the first family of full-domain-hash signatures based on matrix codes. This signature scheme fulfils the paradigm of Gentry, Peikert and Vaikuntanath…
MinRank Gabidulin encryption scheme on matrix codes
Nicolas Aragon, Alain Couvreur, Victor Dyseryn +2
The McEliece scheme is a generic frame which allows to use any error correcting code of which there exists an efficient decoding algorithm to design an encryption scheme by hiding…
RYDE: A Digital Signature Scheme based on Rank-Syndrome-Decoding Problem with MPCitH Paradigm
Loïc Bidoux, Jesús-Javier Chi-Domínguez, Thibauld Feneuil +4
We present a signature scheme based on the Syndrome-Decoding problem in rank metric. It is a construction from multi-party computation (MPC), using a MPC protocol which is a slight…