DeepAI AI Chat
Log In Sign Up

RAMESSES, a Rank Metric Encryption Scheme with Short Keys

by   Julien Lavauzelle, et al.
Université de Rennes 1

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.


page 1

page 2

page 3

page 4


On the security of a Loidreau's rank metric code based encryption scheme

We present a polynomial time attack of a rank metric code based encrypti...

An attack on a NIST proposal: RankSign, a code-based signature in rank metric

RankSign is a code-based signature scheme proposed to the NIST competiti...

McNie2-Gabidulin: An improvement of McNie public key encryption using Gabidulin code

McNie is a code-based public key encryption scheme submitted as a candid...

Low Rank Parity Check Codes: New Decoding Algorithms and Applications to Cryptography

We introduce a new family of rank metric codes: Low Rank Parity Check co...

A Somewhat Homomorphic Encryption Scheme based on Multivariate Polynomial Evaluation

We propose a symmetric key homomorphic encryption scheme based on the ev...

LRPC codes with multiple syndromes: near ideal-size KEMs without ideals

We introduce a new rank-based key encapsulation mechanism (KEM) with pub...

Breaking the encryption scheme of the Moscow internet voting system

In September 2019, voters for the election at the Parliament of the city...