Authors: Jiayong Tang; Fangguo Zhang
Addresses: School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China; Guangdong Provincial Key Laboratory of Information Security, Guangzhou 510006, China ' School of Data and Computer Science, Sun Yat-sen University, Guangzhou 510006, China; Guangdong Provincial Key Laboratory of Information Security, Guangzhou 510006, China
Abstract: More and more data has to be dealt with in the current network computing. An extremely efficient encryption algorithm can greatly improve the efficiency and security of the process in large data environment. As a significant candidate of post-quantum cryptosystem, McEliece public-key cryptosystem (PKC) has one remarkable advantage that it has a very fast and efficient encryption process. In this paper, we put forward a new efficient CPA-secure variant of the McEliece cryptosystem whose advantage is that we can enlarge the plain-text space while the cipher-text space unchanged. We formally prove the security of the scheme. Our proof is based on the learning parity with noise (LPN) problem. We also extend our scheme to a CCA-secure cryptosystem and a signcryption.
Keywords: code-based cryptosystem; McEliece cryptosystem; indistinguishability against a chosen plain-text attack; IND-CPA; IND-CCA; signcryption; cryptography; public key encryption.
International Journal of High Performance Computing and Networking, 2017 Vol.10 No.6, pp.515 - 523
Available online: 04 Oct 2017 *Full-text access for editors Access for subscribers Purchase this article Comment on this article