Skip to Main content Skip to Navigation
Conference papers

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 of nested subcodes which will reveal their secret algebraic description.
Complete list of metadata
Contributor : Jean-Pierre Tillich Connect in order to contact the contributor
Submitted on : Wednesday, January 15, 2014 - 5:12:33 PM
Last modification on : Wednesday, March 2, 2022 - 10:10:08 AM

Links full text



Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich. Polynomial Time Attack on Wild McEliece Over Quadratic Extensions. Advances in Cryptology - Eurocrypt 2014, May 2014, Copenhagen, Denmark. pp.17-39, ⟨10.1007/978-3-642-55220-5_2⟩. ⟨hal-00931774⟩



Record views