Abstract
We present a code-based cryptosystem, in which we use Reed-Solomon codes as secret codes and a weight two matrix for masking, to make the system secure against attacks based on the Schur product. We combine this with the Guruswami-Sudan list decoding for decryption to get lower key sizes. As a consequence, we obtain a key size reduction of 21:8% compared to the standard McEliece cryptosystem proposed by Bernstein et al.