The rank metric measures the distance between two matrices by the rank of their difference.
Codes designed for the rank metric have attracted considerable attention in recent years …

The improvements on quantum technology are threatening our daily cybersecurity, as a
capable quantum computer can break all currently employed asymmetric cryptosystems. In …

We introduce a new rank-based key encapsulation mechanism (KEM) with public key and
ciphertext sizes around 3.5 Kbytes each, for 128 bits of security, without using ideal …

We propose and analyze LowMS, a new rank-based key encapsulation mechanism (KEM).
The acronym stands for Loidreau with Multiple Syndromes, since our work combines the …

We consider decoding of vertically homogeneous interleaved sum-rank-metric codes with
high interleaving order s, that are constructed by stacking s codewords of a single …

This thesis studies code-based cryptography. First, three problems related to code-based
cryptography are investigated and algorithms to solve them are presented. Then, attacks on …

Due to the recent challenges in post-quantum cryptography, several new approaches for
code-based cryptography have been proposed. For example, a variant of the McEliece …

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 …

We investigate the decoding of the sum of Gabidulin codes. We show that there exists a
probabilistic polynomial-time decoder up to some bound. We then give some potential …

In 2005, Faure and Loidreau proposed a new rank-metric cryptosystem inspired from the
Hamming metric scheme of Augot-Finiasz in 2003. In 2018, it was broken by the attack of …