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 …

Algorithms for secure encryption in a post-quantum world are currently receiving a lot of
attention in the research community, including several larger projects and a standardization …

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 …

This paper studies a variant of the McEliece cryptosystem able to ensure that the code used
as the public key is no longer permutation equivalent to the secret code. This increases the …

We adopt a class of quasi-cyclic low-density parity-check codes that allow to overcome the
main limitations of the original McEliece cryptosystem based on Goppa codes, that are large …

We introduce a new family of rank metric codes: Low Rank Parity Check codes (LRPC), for
which we propose an efficient probabilistic decoding algorithm. This family of codes can be …

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 …