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...
Autores Principales: | , , , , |
---|---|
Formato: | Artículo (Article) |
Lenguaje: | Inglés (English) |
Publicado: |
IEEE
2013
|
Materias: | |
Acceso en línea: | https://repository.urosario.edu.co/handle/10336/27398 https://doi.org/10.1109/TIT.2013.2272036 |