PKC-SPE: a variant of the McEliece cryptosystem based on systematic polar encoding Online publication date: Thu, 11-Jul-2024
by Ritu Redhu; Ekta Narwal
International Journal of Computing Science and Mathematics (IJCSM), Vol. 20, No. 1, 2024
Abstract: The public key cryptosystem (PKC), including Rivest, Shamir, Adleman (RSA) and elliptic curve cryptography can be deciphered with the development of quantum computers. As a result, we must find a replacement for these algorithms, and post-quantum cryptography (PQC) is the best solution to this problem. This paper examines public key cryptosystem based on systematic polar encoding (PKC-SPE), the McEliece cryptosystem variant based on systematic polar encoding. A highly reliable and effective cryptosystem based on systematic polar encoding (SPE) is designed using the properties of polar codes. Here, we also examine the error performance, upper bound on error probability, bit error rate (BER) performance for a fixed code rate of 0.85 on various blocklengths with varying bit energy to noise power spectral density ratio (EbNo) and its comparison with non-systematic counterparts. The findings show that this technique has better error performance and a higher encryption rate.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
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 Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and 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
Our Blog 
Follow us on Twitter 
Visit us on Facebook