RAMESSES, a Rank Metric Encryption Scheme with Short Keys - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year : 2020

RAMESSES, a Rank Metric Encryption Scheme with Short Keys

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.
Fichier principal
Vignette du fichier
1911.13119.pdf (280.95 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02426624 , version 1 (02-01-2020)

Identifiers

  • HAL Id : hal-02426624 , version 1

Cite

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

Share

Gmail Mastodon Facebook X LinkedIn More