122 citations · 297 across the 24 of their papers we have counts for
29 papers
Linearized Polynomial Chinese remainder codes
Philippe Gaborit, Camille Garnier, Olivier Ruatta
In this paper, we introduce a new family of codes relevent for rank and sum-rank metrics. These codes are based on an effective Chinese remainders theorem for linearized polynomial…
Injective Rank Metric Trapdoor Functions with Homogeneous Errors
Étienne Burle, Philippe Gaborit, Younes Hatri +1
In rank-metric cryptography, a vector from a finite dimensional linear space over a finite field is viewed as the linear space spanned by its entries. The rank decoding problem whi…
MIRA: a Digital Signature Scheme based on the MinRank problem and the MPC-in-the-Head paradigm
Nicolas Aragon, Loïc Bidoux, Jesús-Javier Chi-Domínguez +4
We exploit the idea of [Fen22] which proposes to build an efficient signature scheme based on a zero-knowledge proof of knowledge of a solution of a MinRank instance. The scheme us…
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…
Generalized LRPC codes
Ermes Franch, Philippe Gaborit, Chunlei Li
In this paper we generalize the notion of low-rank parity check (LRPC) codes by introducing a bilinear product over F^m q based on a generic 3-tensor in Fq^mxmxm, where Fq is the f…
Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem
Magali Bardet, Pierre Briaud, Maxime Bros +2
The Rank Decoding problem (RD) is at the core of rank-based cryptography. This problem can also be seen as a structured version of MinRank, which is ubiquitous in multivariate cryp…