正形置换的一种启发式构造策略  

Heuristics for Construction of Orthomorphic Permutations

作　　者：张旭东[1] 

机构地区：[1]武汉数字工程研究所,武汉430074

出　　处：《计算机与数字工程》2013年第9期1429-1432,共4页Computer & Digital Engineering

摘　　要：正形置换是对称密码体制中一类重要的基础置换。论文提出了一种利用演化算法来优化正形置换的方案,并基于该方案得到了一些密码学性质优良的正形置换。该方法同时使得正形置换的构造实现了自动化,为构造正形置换提供了一种新方法。Abstract Orthomorphic permutation is a kind of important elementary permutation in symmetric cryptography. An evolutionary strate- gy for optimizing orthomorphic permutations is proposed. By experiment based on this strategy, some orthomorphic permutations with good cryptographic properties are gotten. The evolutionary strategy in this paper makes design o{ orthomorphic permutations with good crypto- graphic properties automated, which proposes a new approach to design orthomorphic permutations.

关 键 词：对称密码 正形置换 演化算法 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]