TY - GEN
T1 - Crypto Polar Codes based on Pseudorandom Frozen Bits Values and Indices
AU - El-Sakka, Ahmed H.
AU - Shaaban, Shawki
AU - Moussa, Karim H.
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/12
Y1 - 2019/12
N2 - Polar codes are a talented coding technique with the ability to accomplish the discrete memoryless channel capacity for modern communication systems with high reliability, but it is not secured enough for such systems. A secured system counts on grouping polar codes with secret Mersenne- Twister pseudo-random number generator (MT PRNG) is presented in this paper. The proposed encoder security is deduced from the secret pre-shared initial state of MT PRNG which is considered as the crypto-system ciphering key. The generated sequences are random like and control the frozen bits' values and their indices in the polarized bit channels. When the decoding cipher key at the receiver has one-bit change from the original encoding cipher key, the receiver has an almost 0.5 BER probability. This means that the receiver, in this case, had no clue about the originally sent information data bits without prior knowledge of the utilized 232-bit ciphering key. Moreover, the security of the system can be enhanced by utilizing a pseudo-random number generator (PRBG) with longer seed to increase the system secrecy and decoding obscurity.
AB - Polar codes are a talented coding technique with the ability to accomplish the discrete memoryless channel capacity for modern communication systems with high reliability, but it is not secured enough for such systems. A secured system counts on grouping polar codes with secret Mersenne- Twister pseudo-random number generator (MT PRNG) is presented in this paper. The proposed encoder security is deduced from the secret pre-shared initial state of MT PRNG which is considered as the crypto-system ciphering key. The generated sequences are random like and control the frozen bits' values and their indices in the polarized bit channels. When the decoding cipher key at the receiver has one-bit change from the original encoding cipher key, the receiver has an almost 0.5 BER probability. This means that the receiver, in this case, had no clue about the originally sent information data bits without prior knowledge of the utilized 232-bit ciphering key. Moreover, the security of the system can be enhanced by utilizing a pseudo-random number generator (PRBG) with longer seed to increase the system secrecy and decoding obscurity.
KW - discrete memoryless channel
KW - polar codes
KW - polarized bit channels
UR - http://www.scopus.com/inward/record.url?scp=85083666214&partnerID=8YFLogxK
U2 - 10.1109/JAC-ECC48896.2019.9051085
DO - 10.1109/JAC-ECC48896.2019.9051085
M3 - Conference Proceeding
AN - SCOPUS:85083666214
T3 - Proceedings of the International Japan-Africa Conference on Electronics, Communications and Computations, JAC-ECC 2019
SP - 160
EP - 163
BT - Proceedings of the International Japan-Africa Conference on Electronics, Communications and Computations, JAC-ECC 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 7th International Japan-Africa Conference on Electronics, Communications and Computations, JAC-ECC 2019
Y2 - 15 December 2019 through 16 December 2019
ER -