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....

Full description

Autores:

Tipo de recurso:

Fecha de publicación:

2011

Institución:

Universidad del Rosario

Repositorio:

Repositorio EdocUR - U. Rosario

Idioma:

eng

OAI Identifier:

oai:repository.urosario.edu.co:10336/28909

Acceso en línea:

https://doi.org/10.1109/ITW.2011.6089437
https://repository.urosario.edu.co/handle/10336/28909

Palabra clave:

Cryptography
Vectors
Equations
Decoding
Generators

Rights

License

Restringido (Acceso a grupos específicos)