Cryptology ePrint Archive: Report 2014/112
Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
Alain Couvreur and Ayoub Otmani and Jean-Pierre Tillich
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.
Category / Keywords: public-key cryptography / cryptanalysis, code-based cryptography, McEliece, Wild McEliece
Date: received 13 Feb 2014
Contact author: alain couvreur at lix polytechnique fr
Available format(s): PDF | BibTeX Citation
Note: Accepted to EUROCRYPT 2014.
Due to space constraints, the results are given here without proofs.
They will be included in a forthcoming longer version.
Version: 20140216:154701 (All versions of this report)
Short URL: ia.cr/2014/112
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]