2022/07/28 by José Gómez-Torrecillas, Gómez-Torrecillas, José, F. J. Lobillo +3
Computer Science · Engineering · #16S36 #94A60 #94B35 #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Rings and Algebras (math.RA) #graph theory and CDMA systems
paper · pdf · doi:10.48550/arxiv.2207.14270
openalex publication_date 2022/07/28 · openalex created_date 2022/07/30 · openalex updated_date 2026/07/28
A class of linear codes that extends classic Goppa codes to a non-commutative context is defined. An efficient decoding algorithm, based on the solution of a non-commutative key equation, is designed. We show how the parameters of these codes, when the alphabet is a finite field, may be adjusted to propose a McEliece-type cryptosystem.