Paper 2014/112 Original: eprint.iacr.org/2014/112 ↗
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, that is to say a family of nested subcodes which will reveal their secret algebraic description.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2014-02-16: last updated
- 2014-02-16: published
- Short URL
- https://ia.cr/2014/112
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2014/112,
author = {Alain Couvreur and Ayoub Otmani and Jean-Pierre Tillich},
title = {Polynomial Time Attack on Wild McEliece Over Quadratic Extensions},
howpublished = {Cryptology {ePrint} Archive, Paper 2014/112},
year = {2014},
url = {https://eprint.iacr.org/2014/112}
}