The McEliece cryptosystem is one of the few systems to be considered secure against
attacks by Quantum computers. The original scheme is built upon Goppa codes and …

A very popular trend in code-based cryptography is to decrease the public-key size by
focusing on subclasses of alternant/Goppa codes which admit a very compact public matrix …

The main practical limitation of the McEliece public-key encryption scheme is probably the
size of its key. A famous trend to overcome this issue is to focus on subclasses of …

The design of a practical code-based signature scheme is an open problem in post-quantum
cryptography. This paper is the full version of a work appeared at SIN'18 as a short paper …

Recent public-key cryptography is largely based on number theory problems, such as
factoring or computing of discrete logarithm. These systems constitute an excellent choice in …

The last three years have witnessed tremendous progress in the understanding of code-
based cryptography. One of its most promising applications is the design of cryptographic …

Abstract At SAC 2009, Misoczki and Barreto proposed a new class of codes, which have
parity-check matrices that are quasi-dyadic. A special subclass of these codes were shown …

In this paper we present efficient implementations of McEliece variants using quasi-dyadic
codes. We provide secure parameters for a classical McEliece encryption scheme based on …

Asymmetric cryptographic primitives are essential to enable secure communications in
public networks or public mediums. Such primitives can be deployed as software libraries or …

The main practical limitation of the McEliece cryptosystem is probably the size of its public-
key. To overcome this issue, a famous trend is to decrease the public-key size by focusing …