Encryption Scheme Based on Expanded Reed-Solomon Codes

06/03/2019
by   Karan Khathuria, et al.
0

We present a code-based public-key cryptosystem, in which we use Reed-Solomon codes over an extension field as secret codes and disguise it by considering its expanded code over the base field. Considering the expanded codes provide a safeguard against distinguisher attacks based on the Schur product. Moreover, without using cyclic or quasi-cyclic structure we obtain a key size reduction of nearly 60 Bernstein et al.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2019

Construction of Isodual Quasi-cyclic Codes over Finite Fields

This paper considers the construction of isodual quasi-cyclic codes. Fir...
research
07/04/2021

Expanded Gabidulin Codes and Their Application to Cryptography

This paper presents a new family of linear codes, namely the expanded Ga...
research
03/14/2018

On the Security of Some Compact Keys for McEliece Scheme

In this paper we study the security of the key of compact McEliece schem...
research
12/28/2021

A survey on product codes and 2-D codes

One of the simplest way of combining codes to form new codes is to take ...
research
12/28/2021

A Generalization of Cyclic Code and Applications to Public Key Cryptosystems

In this paper, we define and discuss ϕ-cyclic code, which may be regarde...
research
02/01/2019

Key Recovery Attack on Rank Quasi-Cyclic Code-based Signature Scheme

Rank Quasi-Cyclic Signature (RQCS) is a rank metric code-based signature...
research
09/16/2023

On non-expandable cross-bifix-free codes

A cross-bifix-free code of length n over ℤ_q is defined as a non-empty s...

Please sign up or login with your details

Forgot password? Click here to reset