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

Full description

Autores:

Tipo de recurso:

Fecha de publicación:

2013

Institución:

Universidad del Rosario

Repositorio:

Repositorio EdocUR - U. Rosario

Idioma:

eng

OAI Identifier:

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

Acceso en línea:

https://doi.org/10.1109/TIT.2013.2272036
https://repository.urosario.edu.co/handle/10336/27398

Palabra clave:

Cryptography
Decoding
Polynomials
Linear systems
Generators
Linear codes

Rights

License

Restringido (Acceso a grupos específicos)