Decoding supercodes of Gabidulin codes and applications to cryptanalysis

03/03/2021
by   Maxime Bombar, et al.
0

This article discusses the decoding of Gabidulin codes and shows how to extend the usual decoder to any supercode of a Gabidulin code at the cost of a significant decrease of the decoding radius. Using this decoder, we provide polynomial time attacks on the rank-metric encryption schemes RAMESSES and LIGA.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/29/2019

Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding Radius

We address the problem of decoding Gabidulin codes beyond their error-co...
research
01/04/2022

Fast Decoding of Interleaved Linearized Reed-Solomon Codes and Variants

We construct s-interleaved linearized Reed-Solomon (ILRS) codes and vari...
research
05/02/2023

An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes

In the present article, we discuss the decoding of Gabidulin and related...
research
02/17/2019

Nearest neighbor decoding for Tardos fingerprinting codes

Over the past decade, various improvements have been made to Tardos' col...
research
02/04/2021

Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach

Decoding a Reed-Solomon code can be modeled by a bilinear system which c...
research
09/15/2015

Regular expressions for decoding of neural network outputs

This article proposes a convenient tool for decoding the output of neura...
research
01/22/2018

Improved Power Decoding of Interleaved One-Point Hermitian Codes

We propose a new partial decoding algorithm for h-interleaved one-point ...

Please sign up or login with your details

Forgot password? Click here to reset