RAMESSES, a Rank Metric Encryption Scheme with Short Keys

Julien Lavauzelle 1 Pierre Loidreau 2 Ba-Duc Pham 2
1 GRACE - Geometry, arithmetic, algorithms, codes and encryption
LIX - Laboratoire d'informatique de l'École polytechnique [Palaiseau], Inria Saclay - Ile de France
Abstract : We present a rank metric code-based encryption scheme with key and ciphertext sizes comparable to that of isogeny-based cryptography for an equivalent security level. The system also benefits from efficient encryption and decryption algorithms, which rely on linear algebra operations over finite fields of moderate sizes. The security only relies on rank metric decoding problems, and does not require to hide the structure of a code. Based on the current knowledge, those problems cannot be efficiently solved by a quantum computer. Finally, the proposed scheme admits a failure probability that can be precisely controlled and made as low as possible.
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

Contributor : Pierre Loidreau <>
Submitted on : Thursday, January 2, 2020 - 4:09:07 PM
Last modification on : Saturday, February 1, 2020 - 1:51:29 AM


Files produced by the author(s)


  • HAL Id : hal-02426624, version 1


Julien Lavauzelle, Pierre Loidreau, Ba-Duc Pham. RAMESSES, a Rank Metric Encryption Scheme with Short Keys. 2020. ⟨hal-02426624⟩



Record views


Files downloads