用蚁群算法寻找分组密码差分特征的算法模型  

Algorithm Model of Finding the Differential Characteristics of Block Cipher with Ant Colony

作　　者：邓小艳[1] 杨韧[1] 吉庆兵 

机构地区：[1]成都信息工程学院计算科学系,四川成都610041 [2]现代通信国家重点实验室,四川成都610041

出　　处：《通信技术》2007年第8期69-71,共3页Communications Technology

基　　金：成都信息工程学院院选科研项目资助(GRF200531)

摘　　要：在这篇文章中,首先将寻找分组密码差分特征问题转化为一种在有权重的有向图上找最短路的问题,然后在此基础上提出了一种运用蚁群算法寻找分组密码差分特征的算法模型。In this paper, the problem of finding the differential characteristics of block cipher is transformed into the problem of finding shortest path on digraph with weight. Based on the transformation, a algorithm model of finding the differential characteristics of block cipher is proposed with ant colony.

关 键 词：差分特征 最短路问题 蚁群算法 

分 类 号：TN918[电子电信—通信与信息系统]