2000 character limit reached
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions (1402.3264v2)
Published 13 Feb 2014 in cs.CR, cs.IT, math.IT, and math.NT
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.