Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

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 metadata

Cited literature [55 references]  Display  Hide  Download

Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Tuesday, December 12, 2017 - 4:13:12 PM
Last modification on : Wednesday, March 2, 2022 - 10:10:10 AM


Files produced by the author(s)



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⟩



Record views


Files downloads