Open AccessPolar code‐based secure channel coding scheme with small key size
Author(s) -
Hooshmand Reza,
Aref Mohammad Reza
Publication year - 2017
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.1489
Subject(s) - computer science , polar code , cryptosystem , decoding methods , key (lock) , scrambling , key generation , polar , theoretical computer science , key size , coding (social sciences) , encoding (memory) , cryptography , algorithm , computer network , computer engineering , encryption , computer security , public key cryptography , mathematics , statistics , physics , astronomy , artificial intelligence
In this study, the secret polar encoding and secret successive cancellation decoding algorithms are introduced; with these algorithms, secure and efficient communication can be enhanced between the honest parties. Also, the key size of the proposed polar code‐based secure channel coding system is reduced significantly compared to the existing systems. To decrease the key size, the authors employ the three following methods: (i) a new approach is proposed to save some bit‐channel indices instead of saving the generator matrix of the used polar code; (ii) the permutation and scrambling matrices are not used in this scheme; and (iii) by the help of the properties of polar codes, it does not need to save any vector as part of secret key set to generate an error vector. Moreover, the security analyses demonstrate that this system is resistant against conventional attacks on symmetric‐key code‐based cryptosystems. It means that reducing the key size of the proposed polar code‐based scheme does not affect its security level.