The Constraint Conditions for LDPC Codes in Cryptosystem

McEliece R J. A public-key cryptosystem based onalgebraic coding theory. JPL DSN Progress Report. 1978:42-44, 114-116.[2]Gallager R G. Low density parity check codes[J].IRETransactions on Information Theory.1962, 8(1):21-28[3]Skantzos N S, Saad D, and Kabashima Y. Analysis ofcommon attacks in public-key cryptosystems based onlow-density parity-check codes. Physical Review E, 2003, 68056125.[4]Baldi M and Chiaraluce F. Cryptanalysis of a new instanceof McEliece cryptosystem based on QCLDPC codes.IEEE International Symposium on Information Theory (ISIT2007), Nice, France, June 2007: 2591-2595.[5]Otmani A, Tillich J P, and Dallot L. Cryptanalysis of twoMcEliece cryptosystems based on quasi-cyclic codes. FirstInternational Conference on Symbolic Computation andCryptography (SCC2008), Beijing, China, April 2008: 1-17.[6]Fezal A and Sunjiv S. On low density parity check codes forcombined reliability and security. AFRICON 2007,Windhoek, Namibia, Sept. 2007: 1-5.[7]Garey M R and Johnson D S. Computers and Intractability.New York: W. H. Freeman, 1979: 45-76.[8]MacKay D J C. Good error-correcting codes based on verysparse matrice[J].IEEE Transactions on Information Theory.1999, 45(2):399-431