Ternary Syndrome Decoding with Large Weight

03/18/2019
by   Rémi Bricout, et al.
0

The Syndrome Decoding problem is at the core of many code-based cryptosystems. In this paper, we study ternary Syndrome Decoding in large weight. This problem has been introduced in the Wave signature scheme but has never been thoroughly studied. We perform an algorithmic study of this problem which results in an update of the Wave parameters. On a more fundamental level, we show that ternary Syndrome Decoding with large weight is a really harder problem than the binary Syndrome Decoding problem, which could have several applications for the design of code-based cryptosystems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/01/2017

A New Signature Scheme Based on Punctured Reed--Muller Code With Random Insertion

In this paper, we propose a new signature scheme based on a punctured Re...
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...
research
10/16/2018

Wave: A New Code-Based Signature Scheme

We present here Wave the first 'hash-and-sign' code-based signature sche...
research
05/24/2019

Signature codes for weighted binary adder channel and multimedia fingerprinting

In this paper, we study the signature codes for weighted binary adder ch...
research
08/20/2020

Erasure decoding of convolutional codes using first order representations

In this paper, we employ the linear systems representation of a convolut...
research
08/03/2022

Statistical Decoding 2.0: Reducing Decoding to LPN

The security of code-based cryptography relies primarily on the hardness...
research
01/17/2020

Point-line incidence on Grassmannians and majority logic decoding of Grassmann codes

In this article, we consider the decoding problem of Grassmann codes usi...

Please sign up or login with your details

Forgot password? Click here to reset