“基于混沌的分组密码置换网络的设计”一文提出的一个分组密码算法在已知明文攻击和唯密文攻击下都是很容易被破译的,而且在知道加密变换的条件下,很容易利用分割攻击方法求出该分组密码的密钥。此外,基于Logistic映射的混沌序列的相邻值之间的相互制约性,以及该混沌序列的前若干值对初值的低位比特不敏感。

In this paper, it is pointed out that the block cipher proposed in “Design of Block Cipher substitution network on chaos” can be broken by attack with known plaintext and attack with ciphertext only, and the key of this cipher can be found by the divide-and-conquer attack with the encipher transformation. Furthermore, the mutual restriction between the successive values of the chaos sequences based on the Logistic mapping, and the property that the frontal values of the chaos sequences are not sensitive to the bits on the lower po-sitions of the initial value are also pointed out.