Computer algebra tales on Goppa codes and McEliece cryptography
The 40-year old McEliece public-key crypto-system is revisited with the help of recently developed resources: an improved Peterson–Gorenstein–Zierler decoder for alternant error-correcting codes; PYECC, a purely Python CAS; a package of PYECC functional utilities for the computations involved in def...
| Autores: | , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2020 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/342123 |
| Acceso en línea: | https://hdl.handle.net/2117/342123 https://dx.doi.org/10.1007/s11786-019-00444-1 |
| Access Level: | acceso abierto |
| Palabra clave: | Ciphers Cryptography Goppa codes Symbolic computation Error-correcting codes Post-quantum cryptography Xifres i claus Criptografia Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica::Criptografia |
| Sumario: | The 40-year old McEliece public-key crypto-system is revisited with the help of recently developed resources: an improved Peterson–Gorenstein–Zierler decoder for alternant error-correcting codes; PYECC, a purely Python CAS; a package of PYECC functional utilities for the computations involved in defining, coding and decoding error-correcting codes; and a Web page with free-access to companion materials. The last two tales trace the evolution of the McEliece systems and provide an account about their current security levels. |
|---|