On a Rank-Metric Code-Based Cryptosystem with Small Key Size

12/12/2018
by   Julian Renner, et al.
0

A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem is proposed. The FL cryptosystem is based on the hardness of list decoding Gabidulin codes which are special rank-metric codes. We prove that the recent structural attack on the system by Gaborit et al. is equivalent to decoding an interleaved Gabidulin code. Since all known polynomial-time decoders for these codes fail for a large constructive class of error patterns, we are able to construct public keys that resist the attack. It is also shown that all other known attacks fail for our repair and parameter choices. Compared to other code-based cryptosystems, we obtain significantly smaller key sizes for the same security level.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2018

Repairing the Faure-Loidreau Public-Key Cryptosystem

A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem i...
research
09/09/2018

A Public-Key Cryptosystem from Interleaved Goppa Codes

In this paper, a code-based public-key cryptosystem based on interleaved...
research
12/12/2018

McNie: A code-based public-key cryptosystem

In this paper, we suggest a code-based public key encryption scheme, cal...
research
04/06/2021

Two modifications for Loidreau's code-based cryptosystem

This paper presents two modifications for Loidreau's code-based cryptosy...
research
06/26/2018

Twisted Gabidulin Codes in the GPT Cryptosystem

In this paper, we investigate twisted Gabidulin codes in the GPT code-ba...
research
05/31/2020

New Code-Based Cryptosystem with Arbitrary Error Vectors

McEliece cryptosystem represents a smart open key system based on the ha...
research
01/29/2019

Interleaving Loidreau's Rank-Metric Cryptosystem

We propose and analyze an interleaved variant of Loidreau's rank-metric ...

Please sign up or login with your details

Forgot password? Click here to reset