In this work, we introduce a new attack for the Loidreau scheme [PQCrypto 2017] and its
more recent variant LowMS. This attack is based on a constrained linear system for which …

In this paper, we initiate the study of the Rank Decoding (RD) problem and LRPC codes with
blockwise structures in rank-based cryptosystems. First, we introduce the blockwise errors (ℓ …

A notion of blockwise errors in the context of rank-based cryptography has recently been
introduced in. It allowed to choose more interesting parameters for the original LRPC and …

The rank metric over finite fields has received a lot of attention these last decades. Several
works propose generalizations of this metric to finite rings, each one using a particular …

We present a secret-key encryption scheme based on random rank metric ideal linear codes
with a simple decryption circuit. It supports unlimited homomorphic additions and plaintext …

Both horizontal interleaving as well as the sum-rank metric are currently attractive topics in
the field of code-based cryptography, as they could mitigate the problem of large key sizes …

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 which is …

This thesis studies the effect of algebraic techniques on certain post-quantum cryptosystems.
We give attacks on multivariate and code-based schemes in the rank metric, some of which …

Code-based cryptography is a fertile family of post-quantum algorithms. Its security relies
mostly on the problem of decoding noisy codewords in a random code, which is believed to …

Cette thèse étudie l'effet des approches algébriques sur certains cryptosystèmes
postquantiques. Nous donnons des attaques contre des schémas multivariés et des …