Browsing by Subject "Security gap"
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item Open Access Randomized convolutional and concatenated codes for the wiretap channel(2016-10) Nooraiepour, AlirezaWireless networks are vulnerable to various kinds of attacks such as eavesdropping because of their open nature. As a result, security is one of the most important challenges that needs to be addressed for such networks. To address this issue, we utilize information theoretic secrecy approach and develop randomized channel coding techniques akin to the approach proposed by Wyner as a general method for confusing the eavesdropper while making sure that the legitimate receiver is able to recover the transmitted message. We first study the application of convolutional codes to the randomized encoding scheme. We argue how dual of a code plays a major role in this construction and obtain dual of a convolutional code in a systematic manner. We propose optimal and sub-optimal decoders for additive white Gaussian noise (AWGN) and binary symmetric channels and obtain bounds on the decoder performance extending the existing lower and upper bounds on the error rates of coded systems with maximum likelihood (ML) decoding. Furthermore, we apply list decoding to improve the performance of the sub-optimal decoders. We demonstrate via several examples that security gaps achieved by the randomized convolutional codes compete favorably with some of the existing coding methods. In order to improve the security gap hence the system performance further, we develop concatenated coding approaches applied to the randomized encoding scheme as well. These include serial and parallel concatenated convolutional codes and serial concatenation of a low density generator matrix code with a convolutional code. For all of these solutions low-complexity iterative decoders are proposed and their performance in the wiretap channel is evaluated in terms of the security gap. Numerical examples show that for certain levels of confusion at the eavesdropper, randomized serially concatenated convolutional codes oer the best performance.Item Open Access Randomized convolutional codes for the wiretap channel(Institute of Electrical and Electronics Engineers Inc., 2017) Nooraiepour, A.; Duman, T. M.We study application of convolutional codes to the randomized encoding scheme introduced by Wyner as a way of confusing the eavesdropper over a wiretap channel. We describe optimal and practical sub-optimal decoders for the main and the eavesdropper's channels, and estimate the security gap, which is used as the main metric. The sub-optimal decoder works based on the trellis of the code generated by a convolutional code and its dual, where one encodes the data bits and the other encodes the random bits. By developing a code design metric, we describe how these two generators should be selected for optimal performance over a Gaussian wiretap channel. We also propose application of serially concatenated convolutional codes to this setup so as to reduce the resulting security gaps. Furthermore, we provide an analytical characterization of the system performance by extending existing lower and upper bounds for coded systems to the current randomized convolutional coding scenario. We illustrate our findings via extensive simulations and numerical examples, which show that the newly proposed coding scheme can outperform the other existing methods in the literature in terms of security gap.Item Open Access Randomized serially concatenated LDGM codes for the Gaussian wiretap channel(Institute of Electrical and Electronics Engineers, 2018) Nooraiepour, A.; Duman, Tolga M.We study the application of a special class of low-density parity-check codes to the wiretap channel. We construct a randomized coding scheme based on serially concatenated low-density generator matrix codes and their duals extending the approach used for convolutional and turbo codes. Furthermore, we propose an efficient iterative decoder for this scheme utilizing a joint iterative message passing algorithm. We demonstrate via numerical examples that this approach outperforms other available practical coding alternatives for the Gaussian wiretap channel in terms of the resulting security gap.