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....
| Autores Principales: | , , , , |
|---|---|
| Formato: | Capítulo de libro (Book Chapter) |
| Lenguaje: | Inglés (English) |
| Publicado: |
IEEE
2011
|
| Materias: | |
| Acceso en línea: | https://repository.urosario.edu.co/handle/10336/28909 https://doi.org/10.1109/ITW.2011.6089437 |