2000 character limit reached
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
Published 13 Feb 2014 in cs.CR, cs.IT, math.IT, and math.NT | (1402.3264v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
