Generic Decoding of Restricted Errors

03/15/2023
by   Marco Baldi, et al.
0

Several recently proposed code-based cryptosystems base their security on a slightly generalized version of the classical (syndrome) decoding problem. Namely, in the so-called restricted (syndrome) decoding problem, the error values stem from a restricted set. In this paper, we propose new generic decoders, that are inspired by subset sum solvers and tailored to the new setting. The introduced algorithms take the restricted structure of the error set into account in order to utilize the representation technique efficiently. This leads to a considerable decrease in the security levels of recently published code-based cryptosystems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/25/2022

Information Set Decoding for Lee-Metric Codes using Restricted Balls

The Lee metric syndrome decoding problem is an NP-hard problem and sever...
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
05/27/2022

Interleaved Prange: A New Generic Decoder for Interleaved Codes

Due to the recent challenges in post-quantum cryptography, several new a...
research
08/14/2020

A New Path to Code-based Signatures via Identification Schemes with Restricted Errors

In this paper we introduce a variant of the Syndrome Decoding Problem (S...
research
02/17/2022

Generalized Inverse Based Decoding

The concept of Generalized Inverse based Decoding (GID) is introduced, a...
research
04/26/2021

Classical and Quantum algorithms for generic Syndrome Decoding problems and applications to the Lee metric

The security of code-based cryptography usually relies on the hardness o...

Please sign up or login with your details

Forgot password? Click here to reset