dc.contributor.author | Epelde García, Markel | |
dc.date.accessioned | 2024-05-22T17:00:44Z | |
dc.date.available | 2024-05-22T17:00:44Z | |
dc.date.issued | 2022-12 | |
dc.identifier.citation | Finite Fields and Their Applications 84 : (2022) // Article ID 102097 | es_ES |
dc.identifier.issn | 1071-5797 | |
dc.identifier.issn | 1090-2465 | |
dc.identifier.uri | http://hdl.handle.net/10810/68109 | |
dc.description.abstract | Goppa codes were defined by Valery D. Goppa in 1970. In 1978, Robert J. McEliece used this family of error-correcting codes in his cryptosystem, which has gained popularity in the last decade due to its resistance to attacks from quantum computers. In this paper, we present Goppa codes over the p-adic integers and integers modulo . This allows the creation of chains of Goppa codes over different rings. We show some of their properties, such as parity-check matrices and minimum distance, and suggest their cryptographic application, following McEliece's scheme. | es_ES |
dc.language.iso | eng | es_ES |
dc.publisher | Elsevier | es_ES |
dc.rights | info:eu-repo/semantics/openAccess | es_ES |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/es/ | * |
dc.subject | algebraic codes | es_ES |
dc.subject | Goppa codes | es_ES |
dc.subject | McEliece cryptosystem | es_ES |
dc.title | Goppa codes over the p-adic integers and integers modulo pe | es_ES |
dc.type | info:eu-repo/semantics/article | es_ES |
dc.rights.holder | © 2022 The Author. Published by Elsevier Inc. This is an open access article under the CC
BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/). | es_ES |
dc.rights.holder | Atribución-NoComercial-SinDerivadas 3.0 España | * |
dc.relation.publisherversion | https://www.sciencedirect.com/science/article/pii/S107157972200106X | es_ES |
dc.identifier.doi | 10.1016/j.ffa.2022.102097 | |
dc.departamentoes | Métodos Cuantitativos | es_ES |
dc.departamentoeu | Metodo Kuantitatiboak | es_ES |