Paper 2013/463

Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel

Reza Hooshmand, Masoumeh Koochak Shooshtari, and Mohammad Reza Aref

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.

Note: This paper was submitted to ISCISC2013 on 19 May 2013. This paper was accepted to ISCISC2013 on 25 July 2013.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Minor revision. This paper was submitted to ISCISC 2013 on 19 May 2013 and accepted on 25 July 2013.
Keywords
Secret key cryptosystemCode based cryptographyPolar codes.
Contact author(s)
rhooshmand50 @ yahoo com
History
2013-08-02: received
Short URL
https://ia.cr/2013/463
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2013/463,
      author = {Reza Hooshmand and Masoumeh Koochak Shooshtari and Mohammad Reza Aref},
      title = {Secret Key Cryptosystem based on Polar Codes over Binary Erasure Channel},
      howpublished = {Cryptology ePrint Archive, Paper 2013/463},
      year = {2013},
      note = {\url{https://eprint.iacr.org/2013/463}},
      url = {https://eprint.iacr.org/2013/463}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.