a joint encryption-encoding scheme using qc-ldpc codes based on finite geometry

Joint encryption encoding schemes have been released to fulfill both reliability and security desires in a single step. using low density parity-check (ldpc) codes in joint encryption encoding schemes, as an alternative to classical linear codes, would shorten the key size as well as improving error correction capability. in this article, a joint encryption encoding scheme using quasi-cyclic low density parity-check (qc-ldpc) codes based on finite geometry is presented. it is observed that our proposed scheme not only outperforms its predecessors in key size and transmission rate, but also remains secure against all known cryptanalyses of code-based secret key cryptosystems. in this paper, we have proposed an idea to make qc-ldpc based cryptosystems secure against reaction attacks. it is subsequently shown that our scheme benefits from low computational complexity. by taking the advantage of qc-ldpc codes based on finite geometry, the key size of our scheme is very close to its target security level. in addition, using the proposed scheme, a wide range of desirable transmission rates are achievable. this variety of codes makes our cryptosystem suitable for a number of different communication and cryptographic standards such as wireless personal area networks (wpan) and digital video broadcasting (dvb).