Secrecy Performance Analysis of Hash-Polar Codes in a Wireless Communication System

A hash-polar code algorithm based on the structure of a secure communication system is proposed to enhance data transmission security. However, the research on the hash polar code with belief propagation is very limited, especially regarding secrecy analysis. The preset research analyzes a method utilizing a hash-polar encoder and a belief propagation decoder with different data sizes. A hash function is added for the transmitter to authenticate the reliability of the transmitted bits. Moreover, addictive white Gaussian noise and wiretap channels are used for the receiver and eavesdropper. The effect of different sizes of transferred data on secrecy capacity, secrecy rate, and authentication rate for both users is investigated. According to the analysis, a different size of transmitted data affects the performance of secrecy rate, with the 1024-bit data achieving a slightly higher secrecy rate than the 512-bit data, mostly near the peak. In addition, the increase in Bob's authentication rate for higher data is slightly delayed but eventually achieves similar near-perfect authentication levels. Overall, the proposed hash-polar coding scheme demonstrates improved security and authentication performance, making it a viable approach for secure data transmission in noisy environments.