ScholarLens Back to search
2015•Unpublished venueRequires access

Complexity and performance of QC-MDPC code-based McEliece cryptosystems

Omran Al Rasheed, Predrag Ivaniš

Open publisher page 1 citations

Abstract

In this paper, we analyze security of McEliece cryptosystem based on Low Density Parity Check (LDPC) and Moderate (MDPC) codes, as well as the complexity of the corresponding cryptosystem. Several approaches are proposed to improve the cryptosystem security for the case when complexity of cryptosystem has to be below the prescribed level. A certain modifications of Gradient Descent Bit Flipping (GDBF) decoding algorithm are identified as the crucial part of the cryptosystem that could provide a good trade-off between the complexity cost, decryption latency and security level.

About this research paper

What this paper is about

In this paper, we analyze security of McEliece cryptosystem based on Low Density Parity Check (LDPC) and Moderate (MDPC) codes, as well as the complexity of the corresponding cryptosystem. Several approaches are proposed to improve the cryptosystem security for the case when complexity of cryptosystem has to be below the prescribed level. A certain modifications of Gradient Descent Bit Flipping (GDBF) decoding algorithm are identified as the crucial part of the cryptosystem that could provide a good trade-off between the complexity cost, decryption latency and security level.

Why it matters

OpenAlex reports 1 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

In this paper, we analyze security of McEliece cryptosystem based on Low Density Parity Check (LDPC) and Moderate (MDPC) codes, as well as the complexity of the corresponding cryptosystem. Several approaches are proposed to improve the cryptosystem security for the case when complexity of cryptosystem has to be below the prescribed level. A certain modifications of Gradient Descent Bit Flipping (GDBF) decoding algorithm are identified as the crucial part of the cryptosystem that could provide a good trade-off between the complexity cost, decryption latency and security level.

Key concepts: McEliece cryptosystem, Cryptosystem, Hybrid cryptosystem, Computer science, Post-quantum cryptography, Decoding methods, Low-density parity-check code, Goldwasser–Micali cryptosystem

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Complexity and performance of QC-MDPC code-based McEliece cryptosystems — Research Paper | ScholarLens