2013/07/26 by Reza Hooshmand, Hooshmand, Reza, Masoumeh Koochak Shooshtari +3
Computer Science · Mathematics · #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #cs.CR #cs.IT #math.IT
paper · pdf · doi:10.48550/arxiv.1307.6927
This paper was submitted to ISCISC 2013 on 19 May 2013 and accepted on 25 July 2013
arxiv created 2013/08/01 · arxiv updated 2013/08/02
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.