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 …

Most coding theory experts date the origin of the subject with the 1948 publication of A
Mathematical Theory of Communication by Claude Shannon. Since then, coding theory has …

The McEliece cryptosystem is one of the oldest public-key cryptosystems ever designed. It is
also the first public-key cryptosystem based on linear error-correcting codes. Its main …

In this paper we propose a new approach to investigate the security of the McEliece
cryptosystem. We recall that this cryptosystem relies on the use of error-correcting codes …

The classical McEliece cryptosystem is built upon the class of Goppa codes, which remains
secure to this date in contrast to many other families of codes but leads to very large public …

We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC
codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to …

We cryptanalyse here two variants of the McEliece cryptosystem based on quasi-cyclic
codes. Both aim at reducing the key size by restricting the public and secret generator …

We propose a novel hybrid universal network-coding cryptosystem (HUNCC) to obtain
secure post-quantum cryptography at high communication rates. The secure network-coding …

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 …

Over the past few decades, we have seen a proliferation of advanced cryptographic
primitives with lossy or homomorphic properties built from various assumptions such as …