A Public-Key Cryptosystem from Interleaved Goppa Codes
This addresses the issue of large key sizes in code-based cryptography, which is a practical concern for deployment, though it appears incremental as it builds on existing Goppa code methods.
The paper tackles the problem of reducing key sizes in code-based public-key cryptosystems by proposing a scheme based on interleaved Goppa codes, achieving a key size of 696 Kbits for 128-bit security compared to 1935 Kbits for the classical McEliece scheme.
In this paper, a code-based public-key cryptosystem based on interleaved Goppa codes is presented. The scheme is based on encrypting several ciphertexts with the same Goppa code and adding a burst error to them. Possible attacks are outlined and the key size of several choices of parameters is compared to those of known schemes for the same security level. For example, for security level 128 bits, we obtain a key size of 696 Kbits whereas the classical McEliece scheme based on Goppa codes using list decoding requires a key size of 1935 Kbits.