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: | 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
|
Materias: | |
Acceso en línea: | https://repository.urosario.edu.co/handle/10336/27398 https://doi.org/10.1109/TIT.2013.2272036 |
Ejemplares similares
-
A distinguisher for high rate McEliece cryptosystems
por: Faugère, Jean-Charles, et al.
Publicado: (2011) -
Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
por: Couvreur, Alain, et al.
Publicado: (2014) -
A polynomial-time attack on the BBCRS scheme
por: Couvreur, Alain, et al.
Publicado: (2015) -
Solving the Time-Ahead Pricing of Energy Supply Problem with Nonlinear Utility Function for Consumers via a Bilevel Optimization Approach
por: Huertas, Jorge A., et al.
Publicado: (2019) -
Análisis de correlación
por: Vuskovic, Pedro
Publicado: (2014)