A McEliece cryptosystem using permutation codes

11/03/2021
by   Adarsh Srinivasan, et al.
0

This paper is an attempt to build a new public-key cryptosystem; similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes. We show that these cryptosystems are insecure. However, the general framework in these cryptosystems can use any permutation error-correcting code and is interesting.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/22/2022

Improved constructions of permutation and multi-permutation codes correcting a burst of stable deletions

Permutation codes and multi-permutation codes have been widely considere...
research
05/21/2020

HQC-RMRS, an instantiation of the HQC encryption framework with a more efficient auxiliary error-correcting code

The HQC encryption framework is a general code-based encryption scheme f...
research
05/07/2023

Interpreting Training Aspects of Deep-Learned Error-Correcting Codes

As new deep-learned error-correcting codes continue to be introduced, it...
research
06/07/2022

Neural Network Decoders for Permutation Codes Correcting Different Errors

Permutation codes were extensively studied in order to correct different...
research
11/25/2021

On the Difficulty of Evolving Permutation Codes

Combinatorial designs provide an interesting source of optimization prob...
research
11/03/2020

Nonexistence of perfect permutation codes under the Kendall τ-metric

In the rank modulation scheme for flash memories, permutation codes have...
research
03/29/2020

On the decoding of 1-Fibonacci error correcting codes

The study of new error correcting codes has raised attention in the last...

Please sign up or login with your details

Forgot password? Click here to reset