A distinguisher for high-rate McEliece cryptosystems

The Goppa Code Distinguishing (GD) problem consists in distinguishing the matrix of a Goppa code from a random matrix. The hardness of this problem is an assumption to prove the security of code-based cryptographic primitives such as McEliece's cryptosystem. Up to now, it is widely believed tha...

Descripción completa

Detalles Bibliográficos
Autores Principales: Faugère, Jean-Charles, Gauthier-Umaña, Valérie, Otmani, Ayoub, Perret, Ludovic, Tillich, Jean-Pierre
Formato: Artículo (Article)
Lenguaje:Inglés (English)
Publicado: IEEE 2013
Acceso en línea:https://repository.urosario.edu.co/handle/10336/27398