Embedding Secrecy in Channel Coding with Low Density Parity Check Codes

Ashok Lakkepogu, Deepthi P. Pattathil, and Celine M. Stuart


Low Density Parity Check (LDPC) codes, Random Construction, Belief Propagation, Linear Feedback Shift Register.


A method to combine channel coding with cryptography in such a way as to increase security for a given computational/ hardware complexity or to reduce complexity for a given security in a secure communication system is proposed in this paper. Channel codes which perform very well and provide results near Shannon limit are Low Density Parity Check (LDPC) codes. Random construction methods of LDPC provide room for embedding security in parity check matrix, thereby making decoding difficult for an attacker. Bit Error Rate (BER) performance of the proposed channel coders with keyed randomness are well analyzed for an intended and un-intended user. Results show that a significant increase in security can be achieved without any additional increase in complexity of secure communication system by introducing security in channel coding.

Important Links:

Go Back