A McEliece cryptosystem using permutation codes
This is an incremental study for cryptography researchers, showing limitations in using permutation codes for secure cryptosystems.
The paper tackled building a public-key cryptosystem similar to McEliece using permutation error-correcting codes, but found that these systems are insecure, though the general framework remains interesting.
This paper is an attempt to build a new public-key cryptosystem; similar to the McEliece cryptosystem, using permutation error-correcting codes. We study a public-key cryptosystem built using two permutation error-correcting codes. We show that these cryptosystems are insecure. However, the general framework in these cryptosystems can use any permutation error-correcting code and is interesting. We present an enhanced McEliece cryptosystem which subsumes McEliece cryptosystem based on linear error correcting codes.