Polar code-based cryptosystem: comparative study and analysis of efficiency

Abstract

<p><span>This review paper aims to examine the use of polar codes in public key cryptosystems, providing a comprehensive overview of the state-of-the-art in this field at present. This study thoroughly searches databases such as IEEE Xplore, Scopus, and the ACM digital library to locate relevant research articles. In this study, we demonstrate the use of polar codes in public key cryptography and provide valuable insights for researchers interested in this field of research. The paper identifies several areas for further research and development, such as improved security and reliability of polar code-based cryptosystems. An analysis of the review highlights the major challenges and open research questions in this area, including the need for efficient key generation algorithms and the trade-offs between security and performance. An analysis of various existing encryption techniques as well as their security proofs is provided in the tables.</span></p>

Software implementation of systematic polar encoding based PKC-SPE cryptosystem for quantum cybersecurity

“…The proposed PKC-SPE cryptosystem is being compared to existing schemes 14 in this section. This section evaluates the efficacy and uniqueness of the PKC-SPE cryptosystem against similar existing schemes.…”

“…It is a crucial need that 5G approaches are designed to adopt PQC for public key cryptosystems. Post-quantum cryptographic applications may benefit from polar codes because of many characteristics: It is believed that polar codes are used in various cryptosystems because of their error-correcting abilities, low complexity, and encoding and decoding algorithms that are used to reduce the size of the cryptosystem’s keys 14 . SPE algorithms combine error-correction with the advantage of maintaining the original information bits in their systematic form.…”

Padding Techniques for Identifying Decodable Syndrome in Post-Quantum Digital Signature Schemes

“…A (N, K) Polar code (16) is a type of error-correcting code which is constructed by computing the Kronecker product of the kernel matrix…”

“…For the (16,8) Polar code, the Bhattacharyya parameters of the BSC with a crossover probability of 0.2494 are as follows: Z = [1.0000 1.0000 1.0000 0.9987 1.0000 0.9974 0.9950 0.8638 0.9628 0.6513 0.5300 0.0989] Among all Bhattacharyya parameters, the indices [8 10 11 12 13 14 15 16] correspond to the smallest value, known as Good-Bit Channels. The indices [1 2 3 4 5 6 7 9] corresponding to the largest value of the Bhattacharyya parameters are known as Bad-Bit Channels.…”