A new joint cryptography-channelcoding 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 ...
详细信息
A new joint cryptography-channelcoding 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.
In this study, the authors introduce an efficient securechannelcoding (joint cryptography-channelcoding) scheme based on Latin square low-density lattice codes (Latin square LDLCs) over unconstrained power additive...
详细信息
In this study, the authors introduce an efficient securechannelcoding (joint cryptography-channelcoding) scheme based on Latin square low-density lattice codes (Latin square LDLCs) over unconstrained power additive white Gaussian noise channel. They benefit the properties of Latin square LDLCs to dramatically reduce the key size of the proposed scheme while having an acceptable level of security compared with previous similar schemes. To reduce the key size, they consider two approaches: (i) saving the generating sequence of parity-check matrix of used Latin square LDLC as the part of secret key set;(ii) employing the Hermite normal form of the generator matrix of used Latin square LDLC as the encryption matrix. To provide an acceptable level of security, they consider three other strategies: (i) applying two hard problems related to lattices, i.e. shortest basis problem and closest vector problem;(ii) using a random rational vector as the perturbation (error) vector;(iii) exploiting the special joint encryption/LDLC encoding and joint decryption/LDLC decoding algorithms. Besides, the study discusses other efficiency analysis results consisting error performance and computational complexity of the proposed scheme.
In this study, the secret polar encoding and secret successive cancellation decoding algorithms are introduced;with these algorithms, secure and efficient communication can be enhanced between the honest parties. Also...
详细信息
In this study, the secret polar encoding and secret successive cancellation decoding algorithms are introduced;with these algorithms, secure and efficient communication can be enhanced between the honest parties. Also, the key size of the proposed polar code-based securechannelcoding system is reduced significantly compared to the existing systems. To decrease the key size, the authors employ the three following methods: (i) a new approach is proposed to save some bit-channel indices instead of saving the generator matrix of the used polar code;(ii) the permutation and scrambling matrices are not used in this scheme;and (iii) by the help of the properties of polar codes, it does not need to save any vector as part of secret key set to generate an error vector. Moreover, the security analyses demonstrate that this system is resistant against conventional attacks on symmetric-key code-based cryptosystems. It means that reducing the key size of the proposed polar code-based scheme does not affect its security level.
This paper presents an approach to the construction of block error-correcting code for data transmission systems with short packets. The need for this is driven by the necessity of information interaction between obje...
详细信息
This paper presents an approach to the construction of block error-correcting code for data transmission systems with short packets. The need for this is driven by the necessity of information interaction between objects of machine-type communication network with a dynamically changing structure and unique system of commands or alerts for each network object. The codewords of a code are permutations with a given minimum pairwise Hamming distance. The purpose of the study is to develop a statistical method for constructing a code, in contrast to known algebraic methods, and to investigate the code size. An algorithm for generating codewords has been developed. It can be implemented both by enumeration of the full set of permutations, and by enumeration of a given number of randomly selected permutations. We have experimentally determined the dependencies of the average and the maximum values of the code size on the size of a subset of permutations used for constructing the code. A technique for computing approximation quadratic polynomials for the determined code size dependencies has been developed. These polynomials and their corresponding curves estimate the size of a code generated from a subset of random permutations of such a size that a statistically significant experiment cannot be performed. The results of implementing the developed technique for constructing a code based on permutations of lengths 7 and 11 have been presented. The prediction relative error of the code size did not exceed the value of 0.72% for permutation length 11, code distance 9, random permutation subset size 50,000, and permutation statistical study range limited by 5040.
暂无评论