Improving Upper and Lower Bounds for the Security Performance of Wiretap Channels

This paper compares different algorithms to check semantic security on AWGN wiretap channels. Each algorithm provides upper and lower bounds on the performance of an attack strategy that is close to the best attack strategy. The advantage of these algorithms is that they have lower computational complexity compared to the best attack strategy. We also show that the proposed algorithms can be further improved by including cyclic redundancy check bits and parity check bits generated in the algorithms, for example, when polar codes or LDPC codes according to the 5G standard are used in the coding layer. Finally, we show the compatibility of the algorithms for both polar codes and LDPC codes.