2 citations · 6 across the 5 of their papers we have counts for
4 papers · 1 filter
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…
RQC revisited and more cryptanalysis for Rank-based Cryptography
Loïc Bidoux, Pierre Briaud, Maxime Bros +1
We propose two main contributions: first, we revisit the encryption scheme Rank Quasi-Cyclic (RQC) by introducing new efficient variations, in particular, a new class of codes, the…
Efficient Encryption from Random Quasi-Cyclic Codes
Carlos Aguilar, Olivier Blazy, Jean-Christophe Deneuville +2
We propose a framework for constructing efficient code-based encryption schemes from codes that do not hide any structure in their public matrix. The framework is in the spirit of…