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 defined over a quadratic finite field extension. We show that such codes can be efficiently distinguished from random codes. The attack uses this property to compute a filtration, that is to say, a family of nested subcodes which will reveal their secret algebraic description.
Complete list of metadatas

Cited literature [55 references]  Display  Hide  Download

https://hal.inria.fr/hal-01661935
Contributor : Jean-Pierre Tillich <>
Submitted on : Tuesday, December 12, 2017 - 4:13:12 PM
Last modification on : Thursday, November 21, 2019 - 6:32:53 PM

File

article.pdf
Files produced by the author(s)

Identifiers

Citation

Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich. Polynomial Time Attack on Wild McEliece Over Quadratic Extensions. IEEE Transactions on Information Theory, Institute of Electrical and Electronics Engineers, 2017, 63 (1), pp.404--427. ⟨10.1109/TIT.2016.2574841⟩. ⟨hal-01661935⟩

Share

Metrics

Record views

657

Files downloads

206