Research McEliece Error Correcting Code And Niederreiter Cryptosystems Based

The classical public key cryptosystem based on error correcting codes are McEliece public key cryptosystem and Niederreiter public key cryptosystem. However, they are not suitable for practical application for the disadvantages of low information rate and large key size. In this paper, we propose two modified cryptosystems by analyzing and modifying related algorithms, mainly including two aspects:In the first part, we use Hash function and double public key technology to modify Niederreiter public key cryptosystem which based on maximum rank distance code. After analysis, it is shown that the security of the modified cryptosystem was improved. Then we do some elementary transformations of its check matrix and make it into systematic code form to reduce the size of secret key.In the second part, we use the super ability of correcting burst error and random error of the Reed-Solomon code and combine the deformation five of McEliece public key cryptosystem with Wang Xinmei’s Ms public key cryptosystem to construct a high performance McEliece public-key cryptosystem based on Reed-Solomon code. The new public-key cryptosystem combines encryption function and error correcting function together. Lastly, the performance of the public key cryptosystem was analyzed. It is shown that the security, information rate, error correcting and probability of correct decipher were improved.