Secret key cryptosystem based on non-systematic polar codes

Hooshmand, R ; Sharif University of Technology | 2015

376 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/s11277-015-2691-9
  3. Publisher: Springer New York LLC , 2015
  4. Abstract:
  5. Polar codes are a new class of error correcting linear block codes, whose generator matrix is specified by the knowledge of transmission channel parameters, code length and code dimension. Moreover, regarding computational security, it is assumed that an attacker with a restricted processing power has unlimited access to the transmission media. Therefore, the attacker can construct the generator matrix of polar codes, especially in the case of binary erasure channels, on which this matrix can be easily constructed. In this paper, we introduce a novel method to keep the generator matrix of polar codes in secret in a way that the attacker cannot access the required information to decode the intended polar code. With the help of this method, a secret key cryptosystem is proposed based on non-systematic polar codes. In fact, the main objective of this study is to achieve an acceptable level of security and reliability through taking advantage of the special properties of polar codes. The analyses revealed that our scheme resists the typical attacks on the secret key cryptosystems based on linear block codes. In addition, by employing some efficient methods, the key length of the proposed scheme is decreased compared to that of the previous cryptosystems. Moreover, this scheme enjoys other advantages including high code rate, and proper error performance as well
  6. Keywords:
  7. Block codes ; Channel coding ; Codes (symbols) ; Communication channels (information theory) ; Matrix algebra ; Mobile security ; Binary erasure channel ; Code-based cryptography ; Computational security ; Polar codes ; Secret key ; Secret key cryptosystem ; Security and reliabilities ; Transmission channels ; Cryptography
  8. Source: Wireless Personal Communications ; Volume 84, Issue 2 , September , 2015 , Pages 1345-1373 ; 09296212 (ISSN)
  9. URL: http://link.springer.com/article/10.1007%2Fs11277-015-2691-9