Security gap performance of some LDPC code constructions

In this paper, we assess the behavior of some low-density parity-check (LDPC) code design techniques over the additive white Gaussian (AWGN) wire-tap channel, in terms of security gap. We consider the progressive edge growth (PEG) construction algorithm as a reference, and compare its performance with that of four approaches for designing structured LDPC codes. We consider both systematic and non-systematic transmissions, and show that some structured code design techniques are able to achieve comparable or even better performance than the PEG algorithm over the considered channel, while taking advantage of their simpler encoding and decoding procedures.

[1]  Marco Baldi,et al.  Non-systematic codes for physical layer security , 2010, 2010 IEEE Information Theory Workshop.

[2]  Marco Baldi,et al.  Cryptanalysis of a new instance of McEliece cryptosystem based on QC-LDPC Codes , 2007, 2007 IEEE International Symposium on Information Theory.

[3]  Marco Baldi,et al.  A Physical Layer Secured Key Distribution Technique for IEEE 802.11g Wireless Networks , 2012, IEEE Wireless Communications Letters.

[4]  Marco Baldi,et al.  Design of permuted Serially Concatenated Multiple Parity-Check codes , 2010, SoftCOM 2010, 18th International Conference on Software, Telecommunications and Computer Networks.

[5]  Marco Baldi,et al.  Coding With Scrambling, Concatenation, and HARQ for the AWGN Wire-Tap Channel: A Security Gap Analysis , 2012, IEEE Transactions on Information Forensics and Security.

[6]  Daniel J. Costello,et al.  LDPC block and convolutional codes based on circulant matrices , 2004, IEEE Transactions on Information Theory.

[7]  Hoglah Leena Bollam FINITE-PRECISION ANALYSIS OF DEMAPPERS AND DECODERS FOR LDPC-CODED M-QAM SYSTEMS , 2014 .

[8]  A. D. Wyner,et al.  The wire-tap channel , 1975, The Bell System Technical Journal.

[9]  Torleiv Kløve,et al.  On the generator matrix of array LDPC codes , 2012, SoftCOM 2012, 20th International Conference on Software, Telecommunications and Computer Networks.

[10]  Marco Chiani,et al.  Construction of Near-Optimum Burst Erasure Correcting Low-Density Parity-Check Codes , 2008, IEEE Transactions on Communications.

[11]  Marco Baldi,et al.  LDPC codes based on serially concatenated multiple parity-check codes , 2009, IEEE Communications Letters.

[12]  Marco Baldi,et al.  Interleaved Product LDPC Codes , 2011, IEEE Transactions on Communications.

[13]  Marco Baldi,et al.  On a Family of Circulant Matrices for Quasi-Cyclic Low-Density Generator Matrix Codes , 2011, IEEE Transactions on Information Theory.

[14]  Byung-Jae Kwak,et al.  LDPC Codes for the Gaussian Wiretap Channel , 2009, IEEE Transactions on Information Forensics and Security.

[15]  Marco Baldi,et al.  Security and complexity of the McEliece cryptosystem based on QC-LDPC codes , 2011, ArXiv.

[16]  J. Barros,et al.  LDPC codes for the Gaussian wiretap channel , 2009 .

[17]  Marco Baldi,et al.  A New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes , 2008, SCN.

[18]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[19]  Byung-Jae Kwak,et al.  LDPC codes for physical layer security , 2009, GLOBECOM 2009.

[20]  Sarah J. Johnson,et al.  A family of irregular LDPC codes with low encoding complexity , 2003, IEEE Communications Letters.

[21]  Ng Chun Sum,et al.  LDPC product codes , 2004, The Ninth International Conference onCommunications Systems, 2004. ICCS 2004..

[22]  Desmond P. Taylor,et al.  Multiple serial and parallel concatenated single parity-check codes , 2003, IEEE Trans. Commun..

[23]  Marco Baldi,et al.  Increasing Physical Layer Security through Scrambled Codes and ARQ , 2011, 2011 IEEE International Conference on Communications Workshops (ICC).

[24]  Evangelos Eleftheriou,et al.  Progressive edge-growth Tanner graphs , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[25]  Marco Baldi,et al.  Progressive Differences Convolutional Low-Density Parity-Check Codes , 2012, IEEE Communications Letters.

[26]  Marco Baldi,et al.  Security and complexity of the McEliece cryptosystem based on quasi-cyclic low-density parity-check codes , 2011, IET Inf. Secur..

[27]  Rüdiger L. Urbanke,et al.  The capacity of low-density parity-check codes under message-passing decoding , 2001, IEEE Trans. Inf. Theory.

[28]  Marco Baldi,et al.  Irregular M-SC-MPC codes for wireless applications , 2010, 2010 European Wireless Conference (EW).

[29]  Marco Baldi,et al.  A Class of Low-Density Parity-Check Product Codes , 2009, 2009 First International Conference on Advances in Satellite and Space Communications.