New Code-Based Cryptosystem with Arbitrary Error Vectors
This addresses a practical limitation in post-quantum cryptography for users needing more efficient implementations, but appears incremental as it builds on existing cryptosystem frameworks.
The authors tackled the problem of large public key size in the McEliece cryptosystem by proposing a new code-independent method to reduce key size, achieving a general reduction without specifying concrete numbers.
McEliece cryptosystem represents a smart open key system based on the hardness of the decoding of an arbitrary linear code, which is believed to be able to resist the advent of quantum computers. But the original McEliece cryptosystem, based on Goppa codes, has just very limited interest in practice, partly because it requires a very large public key. In this paper we propose a new general way to reduce the public key size. Unlike most papers on reducing key length of the cryptosystem, where original Goppa codes are substituted by some other codes, we suggest a new method of key size reduction which is code-independent.