We present a polynomial-time structural attack against the McEliece system based on Wild
Goppa codes defined over a quadratic finite field extension. We show that such codes can …

You know your cellphone can distract you and that you shouldn't be texting or surfing the
Web while walking down a crowded street or driving a car. Augmented reality-in the form of …

We give polynomial time attacks on the McEliece public key cryptosystem-based either on
algebraic geometry (AG) codes or on small co-dimensional subcodes of AG codes. These …

In this paper, we study the decoding failure rate (DFR) of non-binary QC-MDPC codes using
theoretical tools, extending the results of previous binary QC-MDPC code studies. The …

Two variations of the McEliece cryptosystem are presented. The first is based on a relaxation
of the column permutation in the classical McEliece scrambling process. This is done in such …

In 1945, mathematician John von Neumann wrote down a very simple recipe for a computer.
It would contain two key components: a central processing unit to perform calculations and …

The advances in quantum technologies became a threat to cryptosystems based on number-
theoretic approach. Therefore, the development of post-quantum algorithms is currently …

Code-based Cryptography (CBC) is a powerful and promising alternative for quantum
resistant cryptography. Indeed, together with lattice-based cryptography, multivariate …

Let C be a linear code of length n and dimension k over the finite field F qm. The trace code
Tr (C) is a linear code of the same length n over the subfield F q. The obvious upper bound …

Using GRS codes directly in the McEliece system is broken by the attack of Sidelnikov and
Shestakov. Rosenthal et al. proposed a variant of the McEliece cryptosystem, denoted by the …