69 citations · 86 across the 9 of their papers we have counts for
4 papers · 1 filter
A Minrank-based Encryption Scheme à la Alekhnovich-Regev
Thomas Debris-Alazard, Philippe Gaborit, Romaric Neveu +1
Introduced in 2003 and 2005, Alekhnovich and Regev' schemes were the first public-key encryptions whose security is only based on the average hardness of decoding random linear cod…
An Algebraic Attack on Rank Metric Code-Based Cryptosystems
Magali Bardet, Pierre Briaud, Maxime Bros +4
The Rank metric decoding problem is the main problem considered in cryptography based on codes in the rank metric. Very efficient schemes based on this problem or quasi-cyclic vers…
RankSign: an efficient signature algorithm based on the rank metric
Philippe Gaborit, Olivier Ruatta, Julien Schrek +1
In this paper we propose a new approach to code-based signatures that makes use in particular of rank metric codes. When the classical approach consists in finding the unique preim…
On the complexity of the Rank Syndrome Decoding problem
Philippe Gaborit, Olivier Ruatta, Julien Schrek
In this paper we propose two new generic attacks on the Rank Syndrome Decoding (RSD) problem Let be a random rank code over and let be a received word…