Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel
This work addresses secure communication for users in noisy channels, but it is incremental as it builds on existing polar code and cryptosystem concepts.
The paper tackles the problem of secure communication by proposing a secret key cryptosystem based on polar codes over a Binary Erasure Channel, achieving significant security advantages against chosen plaintext attacks and reducing key length with a new compression algorithm.
This paper proposes an efficient secret key cryptosystem based on polar codes over Binary Erasure Channel. We introduce a method, for the first time to our knowledge, to hide the generator matrix of the polar codes from an attacker. In fact, our main goal is to achieve secure and reliable communication using finite-length polar codes. The proposed cryptosystem has a significant security advantage against chosen plaintext attacks in comparison with the Rao-Nam cryptosystem. Also, the key length is decreased after applying a new compression algorithm. Moreover, this scheme benefits from high code rate and proper error performance for reliable communication.