A convolutional mask for the McEliece cryptosystem with binary Goppa codes

In this work, we propose a variant of the McEliece cryptosystem using a polynomial mask to hide a binary Goppa code. This new proposal can be seen as a convolutional version of the original McEliece scheme. We analyze its security against standard attacks that have been adapted to the particularities of the new scheme. For the same security levels, our proposal requires public keys that are less than half the size of the public keys used in the Classic McEliece cryptosystem presented to the NIST post-quantum standardization project.