Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel

TL;DR

This paper introduces a secure and efficient cryptosystem using polar codes over Binary Erasure Channels, featuring a novel method to hide the generator matrix and improve security and key length.

Contribution

It presents the first method to conceal the generator matrix of polar codes, enhancing security against attacks and reducing key length with a new compression algorithm.

Findings

Enhanced security against chosen plaintext attacks

Reduced key length due to compression

High code rate and reliable error performance

Abstract

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.