Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
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 of nested subcodes which will reveal their secret algebraic description.