[Resource Topic] 2014/112: Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

Welcome to the resource topic for 2014/112

Title:
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

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

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.

ePrint: https://eprint.iacr.org/2014/112

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .