arXiv · 1402.3264
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, that is to say a family of nested subcodes which will reveal their secret algebraic description.
Explore related subjects
Keep this discovery
Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich. 2014-02-13. Polynomial Time Attack on Wild McEliece Over Quadratic Extensions. https://arxiv.org/abs/1402.3264
Cite the original work for its findings. Save a collection to share your selection of sources.