In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power s...In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.展开更多
Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual perm...Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.展开更多
By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path ...By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path encryption. We present permutation code encryption which is based on path encryption. Now permutation code encryption is a patent of Chinese invention. In Permutation Code Encryption, we use a pseudo-random sequence of the keys to control the paths. The simulation result shows that for n-bit block the encryption strength is novel higher than 2^n and the algorithm can finish the encryption of one block in 7.5 ns, which is unrelated with the block length.展开更多
First this paper introduces the kinds of category of Cipher and the current situation of the Block Cipher. Then it talks about the old concepts holding back the Block Cipher and presents a new concept. Finally, it int...First this paper introduces the kinds of category of Cipher and the current situation of the Block Cipher. Then it talks about the old concepts holding back the Block Cipher and presents a new concept. Finally, it introduces our patent-Permutation Code and the Encipher/Decipher. Its encryption strength exceeds 2^N. With DES having been proved unsafe, we should not enhance the encryption strength just by increasing its block length just as AES does.展开更多
文摘In this paper, we study self-dual permutation codes over formal power series rings and finite principal ideal rings. We first give some results on the torsion codes associated with the linear codes over formal power series rings. These results allow for obtaining some conditions for non-existence of self-dual permutation codes over formal power series rings. Finally, we describe self-dual permutation codes over finite principal ideal rings by examining permutation codes over their component chain rings.
基金Supported by the National Natural Science Foundation of China (60373087, 60473023, 90104005, 60673071)
文摘Permutation codes over finite chain rings are introduced; by using the character of the finite chain rings and the knowledge of representation of group, some conditions for existence or non-existence of self-dual permutation codes over finite chain rings are obtained. Specially, when the group is a direct product of a 2-group and a T-group, and the group action is transitive, the sufficient and necessary condition of the existence of permutation codes is given.
文摘By researching into the attack to present block cipher, we find an essential reason leading to the assailable encryption strength, set up a new block cipher idea and put forward a block cipher encryption concept path encryption. We present permutation code encryption which is based on path encryption. Now permutation code encryption is a patent of Chinese invention. In Permutation Code Encryption, we use a pseudo-random sequence of the keys to control the paths. The simulation result shows that for n-bit block the encryption strength is novel higher than 2^n and the algorithm can finish the encryption of one block in 7.5 ns, which is unrelated with the block length.
文摘First this paper introduces the kinds of category of Cipher and the current situation of the Block Cipher. Then it talks about the old concepts holding back the Block Cipher and presents a new concept. Finally, it introduces our patent-Permutation Code and the Encipher/Decipher. Its encryption strength exceeds 2^N. With DES having been proved unsafe, we should not enhance the encryption strength just by increasing its block length just as AES does.
