McEliece cryptosystem based on Plotkin construction with QC-MDPC and QC-LDPC codes

11/25/2022
by   Belkacem Imine, et al.
0

In this paper, we propose a new variant of the McEliece cryptosystem using two families of quasi-cyclic codes: low density parity check codes (QC-LDPC) and moderate density parity check codes (QC-MDPC). Due to the low weight codewords in the dual of LDPC codes, this family of codes is vulnerable to dual code attacks, making it unsuitable for use with the McEliece cryptosystem. However, this is not the case in our proposal, and it is possible by using the (U |U + V ) construction to concatenate LDPC codes with MDPC codes. We will demonstrate that our proposed cryptosystem can withstand dual code and generic decoding attacks, and that the public key can be reduced by leveraging the quasi-cyclic property and the Plotkin construction.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2019

Analysis of reaction and timing attacks against cryptosystems based on sparse parity-check codes

In this paper we study reaction and timing attacks against cryptosystems...
research
10/04/2018

Construction D^' Lattices from Quasi-Cyclic Low-Density Parity-Check Codes

Recently, Branco da Silva and Silva described an efficient encoding and ...
research
03/17/2021

Moderate Density Parity-Check Codes from Projective Bundles

A new construction for moderate density parity-check (MDPC) codes using ...
research
01/26/2018

LEDAkem: a post-quantum key encapsulation mechanism based on QC-LDPC codes

This work presents a new code-based key encapsulation mechanism (KEM) ca...
research
07/14/2020

Coding theory package for Macaulay2

In this Macaulay2 <cit.> package we define an object called linear code....
research
08/27/2022

Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes

In this paper, we consider how to partition the parity-check matrices (P...

Please sign up or login with your details

Forgot password? Click here to reset