You are looking at a specific version 20140216:154701 of this paper.
See the latest version.
Paper 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.
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.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- cryptanalysiscode-based cryptographyMcElieceWild McEliece
- Contact author(s)
- alain couvreur @ lix polytechnique fr
- History
- 2014-02-16: received
- Short URL
- https://ia.cr/2014/112
- License
-
CC BY