In this work, we propose two McEliece variants: one from Moderate Density Parity-Check
(MDPC) codes and another from quasi-cyclic MDPC codes. MDPC codes are LDPC codes …

In the last years code-based cryptosystems were established as promising alternatives for
asymmetric cryptography since they base their security on well-known NP-hard problems …

In this paper, a new variant of the McEliece cryptosystem, based on quasi-cyclic low-density
parity-check (QC-LDPC) codes, is studied. In principle, such codes can substitute Goppa …

This book describes the fundamentals of cryptographic primitives based on quasi-cyclic low-
density parity-check (QC-LDPC) codes, with a special focus on the use of these codes in …

The results of developing post-quantum algorithms of McEliece and Niederreiter crypto-code
constructs based on LDPC (Low-Density Parity-Check) codes are presented. With the rapid …

In the context of public key cryptography, the McEliece cryptosystem represents a very smart
solution based on the hardness of the decoding problem, which is believed to be able to …

With respect to performance, asymmetric code-based cryptography based on binary Goppa
codes has been reported as a highly interesting alternative to RSA and ECC. A major …

The anticipated emergence of quantum computers in the foreseeable future drives the
cryptographic community to start considering cryptosystems, which are based on problems …

Current widely-used key exchange (KE) mechanisms will be vulnerable to quantum attacks
when sufficiently strong quantum computers become available. Therefore, devising quantum …

Rank metric is a very promising research direction for code-based cryptography. In fact,
thanks to the high complexity of generic decoding attacks against codes in this metric, it is …