Cryptanalysis of the Hwang-Rao Secret Error-Correcting Code Schemes
نویسندگان
چکیده
In this paper, the cryptanalytic strength of two HwangRao Secret Error-Correcting Code (SECC) schemes is examined under a known-plaintext attack. In particular, we found the existence of key information redundancy in all SECCs used in the electronic codebook (ECB) mode. Also, our investigations indicate the existence of synergism in the SECC schemes, that is, the security of SECC (containing three transformations, Ψ and E and P) is much stronger than the individual strength of either Ψ or E or P.
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملImproving the Rao-Nam secret key cryptosystem using regular EDF-QC-LDPC codes
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...
متن کاملOn a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes
In this paper we try to shed a new insight on Verifiable Secret Sharing Schemes (VSS). We first define a new “metric” (with slightly different properties than the standard Hamming metric). Using this metric we define a very particular class of codes that we call error-set correcting codes, based on a set of forbidden distances which is a monotone decreasing set. Next we redefine the packing pro...
متن کاملLinear Multisecret-Sharing Schemes and Error-Correcting Codes
In this paper a characterization of the general relation between linear multisecret-sharing schemes and error-correcting codes is presented. A bridge between linear multisecret-sharing threshold schemes and maximum distance separable codes is set up. The information hierarchy of linear multisecret-sharing schemes is also established. By making use of the bridge several linear multisecret-sharin...
متن کاملLinear Secret Sharing Schemes from Error Correcting Codes and Universal Hash Functions
We present a novel method for constructing linear secret sharing schemes (LSSS) from linear error correcting codes and linear universal hash functions in a blackbox way. The main advantage of this new construction is that the privacy property of the resulting secret sharing scheme essentially becomes independent of the code we use, only depending on its rate. This allows us to fully harness the...
متن کامل