Twisted Goppa Codes With an Efficient Decoding Algorithm and Quasi-Cyclic Properties

Abstract

In this paper, we introduce twisted Goppa codes, which generalize classical Goppa codes by adding a twisted term. Then we provide an efficient decoding algorithm for twisted Goppa codes. The Niederreiter cryptosystem is bassed on linear error-correcting codes in which the public key is a parity check matrix. When twisted Goppa codes are applied to the Niederreiter cryptosystem, the public key size is overlarge. To reduce the public key size, we construct quasi-cyclic twisted Goppa codes via a non-trivial automorphism group carefully selecting the defining set and the matched polynomial. Moreover, we obtain a family of cyclic twisted Goppa codes.