An Efficient and Provably Secure Public Key Encryption Scheme Based on Coding Theory
Although coding-based public key encryption schemes such as McEliece and Niederreiter cryptosystems have been well studied, it is not a trivial task to design an efficient coding-based cryptosystem with semantic security against adaptive Chosen Ciphertext Attacks (IND-CCA2). To tackle this challenging issue, in this paper, the authors first propose an efficient INDCCA2- secure public key encryption scheme based on coding theory. They then use the provable security technique to formally prove the security of the proposed scheme is tightly related to the Syndrome Decoding (SD) problem in the random oracle model. Compared with the previously reported schemes, the proposed scheme is merited with simple construction and fast encryption speed.