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

03/31/2019
by   Nicolas Aragon, et al.
0

We introduce a new family of rank metric codes: Low Rank Parity Check codes (LRPC), for which we propose an efficient probabilistic decoding algorithm. This family of codes can be seen as the equivalent of classical LDPC codes for the rank metric. We then use these codes to design cryptosystems à la McEliece: more precisely we propose two schemes for key encapsulation mechanism (KEM) and public key encryption (PKE). Unlike rank metric codes used in previous encryption algorithms -notably Gabidulin codes - LRPC codes have a very weak algebraic structure. Our cryptosystems can be seen as an equivalent of the NTRU cryptosystem (and also to the more recent MDPC MTSB12 cryptosystem) in a rank metric context. The present paper is an extended version of the article introducing LRPC codes, with important new contributions. We have improved the decoder thanks to a new approach which allows for decoding of errors of higher rank weight, namely up to 2/3(n-k) when the previous decoding algorithm only decodes up to n-k/2 errors. Our codes therefore outperform the classical Gabidulin code decoder which deals with weights up to n-k/2. This comes at the expense of probabilistic decoding, but the decoding error probability can be made arbitrarily small. The new approach can also be used to decrease the decoding error probability of previous schemes, which is especially useful for cryptography. Finally, we introduce ideal rank codes, which generalize double-circulant rank codes and allow us to avoid known structural attacks based on folding. To conclude, we propose different parameter sizes for our schemes and we obtain a public key of 3337 bits for key exchange and 5893 bits for public key encryption, both for 128 bits of security.

READ FULL TEXT
research
05/09/2023

Two new algorithms for error support recovery of low rank parity check codes

Due to their weak algebraic structure, low rank parity check (LRPC) code...
research
06/23/2022

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

We introduce a new rank-based key encapsulation mechanism (KEM) with pub...
research
02/16/2018

Attack on the Edon-K Key Encapsulation Mechanism

The key encapsulation mechanism Edon-K was proposed in response to the c...
research
07/04/2022

RQC revisited and more cryptanalysis for Rank-based Cryptography

We propose two main contributions: first, we revisit the encryption sche...
research
01/29/2023

Rank Generalized Subsapce subcode

Rank metric codes were study by E. Gabidulin in 1985 after a brief intro...
research
11/29/2019

RAMESSES, a Rank Metric Encryption Scheme with Short Keys

We present a rank metric code-based encryption scheme with key and ciphe...
research
04/24/2018

A new class of convolutional codes and its use in the McEliece Cryptosystem

In this paper we present a new class of convolutional codes that admits ...

Please sign up or login with your details

Forgot password? Click here to reset