Polynomial Time Attack on Wild McEliece Over Quadratic Extensions - Archive ouverte HAL
Communication Dans Un Congrès Année : 2014

Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

Résumé

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.

Dates et versions

hal-00931774 , version 1 (15-01-2014)

Identifiants

Citer

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⟩
457 Consultations
0 Téléchargements

Altmetric

Partager

More