New Code-Based Cryptosystem with Arbitrary Error Vectors

05/31/2020
by   Fedor Ivanov, et al.
0

McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key. In this paper we propose a new general way to reduce the public key size. Unlike most papers on reducing key length of the cryptosystem, where original Goppa codes are substituted by some other codes, we suggest a new method of key size reduction which is code-independent.

READ FULL TEXT

page 1

page 2

page 3

page 4

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
06/26/2018

Twisted Gabidulin Codes in the GPT Cryptosystem

In this paper, we investigate twisted Gabidulin codes in the GPT code-ba...
research
03/09/2019

A Lightweight McEliece Cryptosystem Co-processor Design

Due to the rapid advances in the development of quantum computers and th...
research
10/28/2020

On the Failure of the Smart Approach of the GPT Cryptosystem

This paper describes a new algorithm for breaking the smart approach of ...
research
12/12/2018

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

A repair of the Faure-Loidreau (FL) public-key code-based cryptosystem i...
research
03/01/2021

New Public-Key Crypto-System EHT

In this note, an LWE problem with a hidden trapdoor is introduced. It is...
research
02/03/2021

Efficient Decoding of Gabidulin Codes over Galois Rings

This paper presents the first decoding algorithm for Gabidulin codes ove...

Please sign up or login with your details

Forgot password? Click here to reset