Distinguisher-based attacks on public-key cryptosystems using Reed-Solomon codes
Because of their interesting algebraic properties, several authors promote the use of generalized Reed-Solomon codes in cryptography. Niederreiter was the first to suggest an instantiation of his cryptosystem with them but Sidelnikov and Shestakov showed that this choice is insecure. Wieschebrink pr...
Autores Principales: | Couvreur, Alain, Gaborit, Philippe, Gauthier-Umaña, Valérie, Otmani, Ayoub, Tillich, Jean-Pierre |
---|---|
Formato: | Artículo (Article) |
Lenguaje: | Inglés (English) |
Publicado: |
Kluwer Academic Publishers
2014
|
Materias: | |
Acceso en línea: | https://repository.urosario.edu.co/handle/10336/23845 https://doi.org/10.1007/s10623-014-9967-z |
Ejemplares similares
-
A polynomial-time attack on the BBCRS scheme
por: Couvreur, Alain, et al.
Publicado: (2015) -
A distinguisher for high-rate McEliece cryptosystems
por: Faugère, Jean-Charles, et al.
Publicado: (2013) -
Assuring BetterTimes
por: Hallgren P., et al.
Publicado: (2018) -
Carta de Thomas Reed sin destinatario
por: Reed, Thomas
Publicado: (2016) -
A distinguisher for high rate McEliece cryptosystems
por: Faugère, Jean-Charles, et al.
Publicado: (2011)