4G mobile communication is a global technology. Therefore, it is essential to enforce confidentiality between mobile users and their networks. This paper presents a Group Security Authentication and Key Agreement Protocol Built by Elliptic Curve Diffie Hellman Key Exchange (GSAKA-ECDHKE) to overcome and address the LTE networks Evolved Packet System Authentication and Key Agreement Protocol (EPS-AKA) protocol flaws and vulnerabilities. GSAKA-ECDHKE is presented for 4G mobile military group communications to provide security, confidentiality, and privacy while the users and networks authenticate. By embedding the Group Commander (GC) role in the EPS-AKA protocol to control the member authentication in the group. GSAKA-ECDHKE protocol is based on Elliptic Curve Diffie Hellman Key Exchange (ECDHKE) and hash function to generate and share secret Elliptic Curve (EC) key to encrypt and protect the routing authentication parameters. The Automated Validation of Internet Security Protocols and Applications (AVISPA) tool is used for security analysis and formal verification. AVISPA demonstrated that GSAKA-ECDHKE had overcome various known security attacks such as Man In The Middle (MITM), replay attacks, and Denial of Services (DoS) attacks, satisfying the evaluated security requirements. Additionally, the suggested protocol provides the lowest communication overheads compared to the existing group-based AKA protocols.

The polar code is a unique coding approach that can achieve Shannon's capacity in modern communication systems' discrete memory-less channels with superior reliability, but it is not secure enough under modern attacks for such systems. This study aims to offer a comprehensive secured polar coding scheme that uses a combination of polar coding and the Mersenne-Twister pseudo-random number generator (MT-PRNG) to achieve a super secured encoding. The pre-shared crypto-system cyphering key initiates the starting state of the MT-PRNG as a seed. The randomly generated sequences govern the values of the frozen bits in polarized bit channels and their associated indices. A half-bit-error-rate probability system performance is calculated when the encoding ciphering keys at the receiver differ by a single bit from those utilized at the transmitter. Using calculated numerical analysis, the system is shown to be secure against brute force attacks, Rao-Nam attacks, and polar code reconstruction attacks.

No abstract

In modern communication systems, there is an increasing need for more capacity-achieving coding schemes to fulfill high data rates demands. Polar codes are very promising candidates to achieve near Shannon’s capacity and improved systems’ reliability due to their polarized channel construction idea which depends on utilizing the good channel in data transmission and consumes the noisy ones in frozen bits transmission as pilots. This paper presented the performance of polar codes for binary-erasure-channel, binary-symmetric channel, and additive-white-Gaussian-noise-channel at various rates and different design parameter to find the optimum ones for these channels. The numerical analysis showed that when the rate increased the system bit error rate performance degrades, while it is improved when the design parameters are optimized for all the studied channels.

No abstract