提出了一种演化密文与规则的加密方法,以细胞自动机的初态和规则作为演化对象,寻找满足经过迭代后能得到原文细胞自动机的初态和规则.某些原文只在某些特殊规则下才存在满足完全匹配的密文,而且匹配度越高搜索越耗时,所以引入了校验信息,以最大演化代数作为演化计算的终止条件,寻找迭代后与原文最匹配的密文,再通过校验获得完整的原文.通过实验得出:此种加密方法具有较大的密钥空间和良好的置乱效果,而且细胞自动机的邻居半径越大,演化计算的表现越稳定.%This paper proposed a new kind of data encryption method based on evolvable cellular automata( CA), which used the CAs' initial configuration and the rule as the object of evolution to find out the cipher text which was close to the original text after evolution by CAs. As there was very little perfect cipher text exit and much more time would been used for get a high matching score, introduced the parity information and used the maximum age as the termination condition of evolutionary algorithm which check the parity value is need for original text by decrypting the closest cipher text after evolution. The experimental results show that this encryption method has a large key space and good scrambling effect, and the larger cellular automata neighborhood radius is, the more stable the performance of evolutionary computation.
展开▼
