A distinguisher for high rate McEliece cryptosystems

The Goppa Code Distinguishing (GCD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. Up to now, it is widely believed that the GCD problem is a hard decisional problem. We present the first technique allowing to distinguish alternant and Goppa codes over any field....

Descripción completa

Detalles Bibliográficos
Autores Principales: Faugère, Jean-Charles, Gauthier-Umanã, Valérie, Otmani, Ayoub, Perret, Ludovic, Tillich, Jean-Pierre
Formato: Capítulo de libro (Book Chapter)
Lenguaje:Inglés (English)
Publicado: IEEE 2011
Acceso en línea:https://repository.urosario.edu.co/handle/10336/28909