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

Full description

Autores:
Tipo de recurso:
Fecha de publicación:
2014
Institución:
Universidad del Rosario
Repositorio:
Repositorio EdocUR - U. Rosario
Idioma:
eng
OAI Identifier:
oai:repository.urosario.edu.co:10336/23845
Acceso en línea:
https://doi.org/10.1007/s10623-014-9967-z
https://repository.urosario.edu.co/handle/10336/23845
Palabra clave:
Matrix algebra
Public key cryptography
Recovery
Reed-Solomon codes
Code-based cryptography
Distinguishers
Generalized reed-solomon codes
Ho-momorphic encryptions
Key-recovery
Codes (symbols)
Code-based cryptography
Distinguisher
Generalized Reed-Solomon codes
Homomorphic encryption
Key-recovery
Rights
License
Abierto (Texto Completo)