Skew differential Goppa codes and their application to McEliece cryptosystem

07/28/2022
by   José Gómez-Torrecillas, et al.
0

A class of linear codes that extends classic Goppa codes to a non-commutative context is defined. An efficient decoding algorithm, based on the solution of a non-commutative key equation, is designed. We show how the parameters of these codes, when the alphabet is a finite field, may be adjusted to propose a McEliece-type cryptosystem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/25/2019

Peterson-Gorenstein-Zierler algorithm for differential convolutional codes

Differential Convolutional Codes with designed Hamming distance are defi...
research
05/31/2020

Decoding Reed-Solomon Skew-Differential Codes

A large class of MDS linear codes is constructed. These codes are endowe...
research
12/21/2018

Reed-Solomon-Gabidulin Codes

We introduce Reed-Solomon-Gabidulin codes which is, at the same time, an...
research
09/28/2021

The q-ary antiprimitive BCH codes

It is well-known that cyclic codes have efficient encoding and decoding ...
research
02/03/2021

Efficient Decoding of Gabidulin Codes over Galois Rings

This paper presents the first decoding algorithm for Gabidulin codes ove...
research
11/13/2019

Enumerative Data Compression with Non-Uniquely Decodable Codes

Non-uniquely decodable codes can be defined as the codes that cannot be ...
research
04/26/2019

Cryptanalysis of a System Based on Twisted Reed-Solomon Codes

It was recently proved that twisted Reed--Solomon codes represent a fami...

Please sign up or login with your details

Forgot password? Click here to reset