Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
Alain Couvreur, Ayoub Otmani, Jean–Pierre Tillich · IEEE Transactions on Information Theory · 2016
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 be efficiently distinguished from random codes. The attack uses this property to compute a filtration, that is to say, a family of nested subcodes which will reveal their secret algebraic description.