Work

Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

Year: 2014

Type: preprint

Abstract: We present a polynomial time structural attack against the McEliece system based on Wild Goppa codes from a quadratic finite field extension. This attack uses the fact that such codes can be distinguished from random codes to compute some filtration, that is to say a family of nested subcodes which will reveal their secret algebraic description.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.1402.3264

Authors: Couvreur, Alain, Otmani, Ayoub, Tillich, Jean-Pierre

Institutions: Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, École Polytechnique, Normandie Université, Laboratoire d'Informatique de l'École Polytechnique

Language: English

Topic: Coding theory and cryptography

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2949275686

Cites:

Cited by:

Related to: 20