Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
Cryptography and Security
2015-07-27 v2 Information Theory
math.IT
Number Theory
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.
Cite
@article{arxiv.1402.3264,
title = {Polynomial Time Attack on Wild McEliece Over Quadratic Extensions},
author = {Alain Couvreur and Ayoub Otmani and Jean-Pierre Tillich},
journal= {arXiv preprint arXiv:1402.3264},
year = {2015}
}
Comments
The material of this article was presented at the conference EUROCRYPT 2014 (Copenhagen, Denmark) and published in its proceedings. Due to space constraints, most of the proofs were omitted in the proceedings version. The present article is a long revisited version including all the missing proofs