The advent of fifth-generation (5G) technology has ushered in a new era of connectivity, promising unprecedented data rates and ultra-reliable low-latency communication. As the demand for high-speed and secure communication continues to surge, there is a critical need for robust communication systems to increase wireless networks' security level. In this context, this paper investigates secure communication techniques, specifically focusing on utilizing the hash function as an authentication mechanism and the presence of polar codes. The integration of polar codes within the communication framework and their effectiveness are examined to enhance error correction capabilities by ensuring the integrity of transmitted data. Furthermore, the transmissions between Alice, Bob, and Eve are evaluated in terms of authentication rate, secrecy rate, and secrecy capacity in determining the effect of the hash function, the presence of channel pre-coding algorithm, and various codeword lengths. This paper also investigates the impact of different codeword values on the overall system performance, shedding light on the advantages of tailoring these parameters to the unique requirements of 5G networks. The results found that the performance of secure communication with the presence of polar codes is better than that of transmission without polar codes. The secrecy rate is reduced to below 10−4after the transmission reaches 7 dB, Bob's authentication rate remains high, almost reaching 1.
The advent of fifth-generation (5G) technology has ushered in a new era of connectivity, promising unprecedented data rates and ultra-reliable low-latency communication. As the demand for high-speed and secure communication continues to surge, there is a critical need for robust communication systems to increase wireless networks' security level. In this context, this paper investigates secure communication techniques, specifically focusing on utilizing the hash function as an authentication mechanism and the presence of polar codes. The integration of polar codes within the communication framework and their effectiveness are examined to enhance error correction capabilities by ensuring the integrity of transmitted data. Furthermore, the transmissions between Alice, Bob, and Eve are evaluated in terms of authentication rate, secrecy rate, and secrecy capacity in determining the effect of the hash function, the presence of channel pre-coding algorithm, and various codeword lengths. This paper also investigates the impact of different codeword values on the overall system performance, shedding light on the advantages of tailoring these parameters to the unique requirements of 5G networks. The results found that the performance of secure communication with the presence of polar codes is better than that of transmission without polar codes. The secrecy rate is reduced to below 10−4after the transmission reaches 7 dB, Bob's authentication rate remains high, almost reaching 1.
In this paper, we investigate multi-message authentication to combat adversaries with infinite computational capacity. An authentication framework over a wiretap channel (W_1, W_2) is proposed to achieve information-theoretic security with the same key. The proposed framework bridges the two research areas in physical (PHY) layer security: secure transmission and message authentication. Specifically, the sender Alice first transmits message M to the receiver Bob over (W_1, W_2) with an error correction code; then Alice employs a hash function (i.e., ε-AWU_2 hash functions) to generate a message tag S of message M using key K, and encodes S to a codeword X^n by leveraging an existing strongly secure channel coding with exponentially small (in code length n) average probability of error; finally, Alice sends X^n over (W_1, W_2) to Bob who authenticates the received messages. We develop a theorem regarding the requirements/conditions for the authentication framework to be information-theoretic secure for authenticating a polynomial number of messages. Based on this theorem, we propose and implement an efficient and feasible authentication protocol over binary symmetric wiretap channel (BSWC) by using Linear Feedback Shifting Register based (LFSR-based) hash functions and strong secure polar code. Through extensive experiments, it is demonstrated that the proposed protocol can achieve low time cost, high authentication rate, and low authentication error rate.
5G wireless networks are evolving to meet the rapid increase in the demand of the users to get high-quality broadband services with high-speed data rate. This advance development came up with a lot of challenges such as coverage region, security, energy efficiency, spectrum utilization, cost, latency, and data rate. To ensure the security, there are many conventional key exchange algorithms that need complex infrastructure. In recent times, physical layer-based security has gained a lot of attention since it offers the simple and efficient way of key exchange by exploiting wireless channel characteristics. In this project, for secret key sharing between the two legitimate users through the correlated channel that is shared with eavesdropper, a pre-equalization transmit filter that inverts the main channel is employed. Further to decrease the probability of interception by eavesdropper while permitting successful decoding by the legitimate user. Low-Density Parity Check (LDPC) code is used to assure reliable communication. Modulation schemes such as basic QPSK and 64,128 and 256- QAM are used to achieve higher bit rates. To achieve high secrecy between the legitimate users zero forcing algorithm is used to invert the channel. Through simulations, the effect of channel correlation will be studied to analyze the low secret key mismatch between the Bob and Eve. Here Eve having high Bit Error Rate(BER) so that eve could not obtain the original bits. The simulation will be done using Matlab.
Suppose Alice wishes to send messages to Bob through a communication channel C_1, but her transmissions also reach an eavesdropper Eve through another channel C_2. The goal is to design a coding scheme that makes it possible for Alice to communicate both reliably and securely. Reliability is measured in terms of Bob's probability of error in recovering the message, while security is measured in terms of Eve's equivocation ratio. Wyner showed that the situation is characterized by a single constant C_s, called the secrecy capacity, which has the following meaning: for all ε>0, there exist coding schemes of rate R≥Cs−ε that asymptotically achieve both the reliability and the security objectives. However, his proof of this result is based upon a nonconstructive random-coding argument. To date, despite a considerable research effort, the only case where we know how to construct coding schemes that achieve secrecy capacity is when Eve's channel C_2 is an erasure channel, or a combinatorial variation thereof. Polar codes were recently invented by Arikan; they approach the capacity of symmetric binary-input discrete memoryless channels with low encoding and decoding complexity. Herein, we use polar codes to construct a coding scheme that achieves the secrecy capacity for a wide range of wiretap channels. Our construction works for any instantiation of the wiretap channel model, as long as both C_1 and C_2 are symmetric and binary-input, and C_2 is degraded with respect to C_1. Moreover, we show how to modify our construction in order to provide strong security, in the sense defined by Maurer, while still operating at a rate that approaches the secrecy capacity. In this case, we cannot guarantee that the reliability condition will be satisfied unless the main channel C_1 is noiseless, although we believe it can be always satisfied in practice.
In a classical wiretap channel setting, Alice communicates with Bob through a main communication channel, while her transmission also reaches an eavesdropper Eve through a wiretap channel. In this paper, we consider a general class of polar secrecy codes for wiretap channels and study their finite-length performance. In particular, bounds on the normalized mutual information security (MIS) leakage, a fundamental measure of secrecy in information-theoretic security frameworks, are presented for polar secrecy codes. The bounds are utilized to characterize the finite-length scaling behavior of polar secrecy codes, where scaling here refers to the non-asymptotic behavior of both the gap to the secrecy capacity as well as the MIS leakage. Furthermore, the bounds are shown to facilitate characterizing numerical bounds on the secrecy guarantees of polar secrecy codes in finite block lengths of practical relevance, where directly calculating the MIS leakage is in general infeasible.
Secrecy rate optimization has emerged as a critical aspect of secure wireless communications to ensure confidential data exchange in the presence of eavesdroppers. However, increasing reliance on wireless technologies has also raised concerns about security and privacy. This paper demonstrates an analysis of secrecy performance through SNR and channel capacity, including the derivation of closed-form expressions and SOP under various channel conditions. The study assumes a uniform distribution for the location of the eavesdroppers, reflecting realistic interception scenarios. The calculated SOP serves as a crucial indicator of the likelihood that the secrecy rate drops below a secure threshold, thus highlighting potential vulnerabilities. To validate the analytical results, extensive simulations are conducted that demonstrate the accuracy and effectiveness of the derived expressions in different wireless environments. The findings underscore the importance of secrecy rate analysis in the design of secure wireless systems, providing valuable insights for optimizing information transmission while protecting against eavesdropping threats.
Polar codes have emerged as a powerful error correction technique for reliable data transmission in various communication systems. The addition of cyclic redundancy check (CRC) can significantly enhance the reliability of polar codes by providing an additional layer of error detection and correction. Without CRC, a system will lack a mechanism that detects and corrects decoding errors. By appending CRC bits to the polar-encoded data, the receiver with a belief propagation (BP) decoder can perform CRC to verify the correctness of the received information, enabling error detection beyond the capabilities of polar codes alone. This paper mainly focuses on incorporating CRC codes into polar codes and evaluating performance after the codes were transmitted into an additive white Gaussian channel. The CRC-aided BP decoder was simulated using MATLAB. The block length, N, was set to 256 and 1024 bits, and CRC varied between 12 and 16 bits for each N. The decoder system was tested with different numbers of iterations (50, 100, 200, and 500) to verify the performance in terms of bit error rate and frame error rate. Overall, this research provides a comprehensive analysis of the utilization of CRC for polar codes, considering different CRC sizes, numbers of iterations for BP decoding, and various block lengths. The average number of iterations of 200 and increasing CRC shows the lowest error rate readings throughout an increase in noise. The use of 12 and 16 bits of CRC further enhances the decoder’s error detection and correction capability.