Open AccessNew secure channel coding scheme based on randomly punctured quasi‐cyclic‐low density parity check codes
Author(s) -
Esmaeili Mostafa,
Dakhilalian Mohammad,
Gulliver T. Aaron
Publication year - 2014
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2014.0101
Subject(s) - low density parity check code , scrambling , cryptosystem , cryptography , computer science , coding (social sciences) , parity bit , mathematics , algorithm , theoretical computer science , channel code , decoding methods , statistics
A new joint cryptography‐channel coding technique is introduced which employs punctured quasi‐cyclic‐low density parity check (QC‐LDPC) codes obtained from extended difference families. The absence of permutation and scrambling matrices reduces the key size compared with similar code‐based cryptosystems, while having an acceptable level of security. The main advantage of this system is that, provided the system parameters are chosen appropriately, even if the code employed is revealed the system remains secure. Performance results are presented which show that the punctured code outperforms a random low density parity check (LDPC) code of the same length and rate.