A new code-based encryption scheme and its applications
by Jiayong Tang; Fangguo Zhang
International Journal of High Performance Computing and Networking (IJHPCN), Vol. 10, No. 6, 2017

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.

Online publication date: Wed, 04-Oct-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Computing and Networking (IJHPCN):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com