Code-based cryptosystem with provable security

To construst a public-key cryptosystem that can resist quantum computers,a provable F-Niederreiter PKC is designed by using error correcting code theory.By means of reviewing currently know attacks to the F-Niederreiter PKC,the assumption that without any decryption oracles or any partial knowledge on the plaintext of the challenge ciphertext,no polynomial-time algorithm can break F-Niederreiter PKC,is obtained.Then,a new F-Niederreiter PKC under the assumption is proposed,and the new F-Niederreiter PKC can be proved,in the random oracle model,to be IND-CCA2 security.