Improving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
Authors
Abstract:
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Rao-Nam cryptosystem against chosen plaintext attacks, benefiting from an improvement on the structure of the Rao-Nam cryptosystem and proper choices of code parameters. Moreover, the proposed cryptosystem benefits from the highest code rate and a proper error performance.
similar resources
Improving the Rao-NamSecret KeyCryptosystemUsingRegular EDF-QC-LDPCCodes
This paper proposes an efficient joint secret key encryption-channel coding cryptosystem, based on regular Extended Difference Family Quasi-Cyclic Low-Density Parity-Check codes. The key length of the proposed cryptosystem decreases up to 85 percent using a new efficient compression algorithm. Cryptanalytic methods show that the improved cryptosystem has a significant security advantage over Ra...
full textSecret Key Cryptosystem Based on Non-systematic Polar Codes
˗ Polar codes are provably capacity achieving linear block codes. The generator matrix of these codes is specified by knowing the parameters of transmission channel, length and dimension of the used code. On the other hand, for the cryptosystems based on general decoding problem (i.e. code based cryptosystems), the generator matrix of the applied code should be properly hidden from the attacker...
full textLDPC Codes in the McEliece Cryptosystem
The original McEliece cryptosystem, based on Goppa codes, has two important drawbacks: long keys and low transmission rate. LDPC codes seem natural candidates to overcome such drawbacks, because of their sparse parity-check matrices, that could form the public keys, and the flexibility in transmission rates. Moreover, quasi-cyclic (QC) LDPC codes could permit to further reduce the key length. S...
full textRegular Ldpc Codes
We propose a method to recover the structure of a randomly permuted chained code and how to cryptanalyse cryptographic schemes based on these kinds of error coding. As application of these methods is a cryptographic schema using regular Low Density Parity Check (LDPC) Codes. This result prohibits the use of chained code and particularly regular LDPC codes on cryptography.
full textSecurity and complexity of the McEliece cryptosystem based on QC-LDPC codes
In the context of public key cryptography, the McEliece cryptosystem represents a very smart solution based on the hardness of the decoding problem, that is believed to be able to resist the future advent of quantum computers. Despite this, the original McEliece cryptosystem, based on Goppa codes, has encountered limited interest in practical applications, partly because of some constraints imp...
full textA New Analysis of the McEliece Cryptosystem Based on QC-LDPC Codes
We improve our proposal of a new variant of the McEliece cryptosystem based on QC-LDPC codes. The original McEliece cryptosystem, based on Goppa codes, is still unbroken up to now, but has two major drawbacks: long key and low transmission rate. Our variant is based on QC-LDPC codes and is able to overcome such drawbacks, while avoiding the known attacks. Recently, however, a new attack has bee...
full textMy Resources
Journal title
volume 4 issue 1
pages 3- 14
publication date 2012-01-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023