Polynomial Time Attack on Wild McEliece Over Quadratic Extensions - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Information Theory Year : 2017

Polynomial Time Attack on Wild McEliece Over Quadratic Extensions

(1, 2) , (3) , (4)
1
2
3
4

Abstract

We present a polynomial-time structural attack against the McEliece system based on Wild Goppa codes defined over a quadratic finite field extension. We show that such codes can be efficiently distinguished from random codes. The attack uses this property to compute a filtration, that is to say, a family of nested subcodes which will reveal their secret algebraic description.
Fichier principal
Vignette du fichier
article.pdf (528.17 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01661935 , version 1 (12-12-2017)

Identifiers

Cite

Alain Couvreur, Ayoub Otmani, Jean-Pierre Tillich. Polynomial Time Attack on Wild McEliece Over Quadratic Extensions. IEEE Transactions on Information Theory, 2017, 63 (1), pp.404--427. ⟨10.1109/TIT.2016.2574841⟩. ⟨hal-01661935⟩
524 View
144 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More