Paper 2014/112

Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

Alain Couvreur, 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)
PDF
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
Creative Commons Attribution
CC BY

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},
      note = {\url{https://eprint.iacr.org/2014/112}},
      url = {https://eprint.iacr.org/2014/112}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.