基于双ibutterfly网络的插入排序算法  

Insertion sorting algorithm for double ibutterfly network

作　　者：陈帆 徐金甫[1] 常忠祥[1] 

机构地区：[1]信息工程大学密码工程学院,河南郑州450001

出　　处：《计算机工程与设计》2015年第6期1468-1471,1481,共5页Computer Engineering and Design

摘　　要：为实现密码算法硬件实现过程中序列插入排序的高效性,对序列排序特点和当前最为有效的GRP插入排序算法进行分析,基于ibutterfly网络的插入排序实现效率的评估策略,针对GRP算法存在的潜在缺陷,给出GRP算法的改进算法及其硬件实现。利用Matlab对改进算法的实现效率进行验证,基于Design Complier综合工具对其硬件电路进行性能评估,评估结果表明,在硬件面积增加8.2%的基础上,该方案能够有效提升GRP算法的灵活高效性,验证了改进方案的合理性。To improve the effectiveness of inserting and collating sequences in the implementation process of cryptographic algo‐rithms ,the characteristic of the sequences arrangement and the GRP algorithm which was the most popular and effective algo‐rithm at present were analyzed .Then the evaluation strategy for the efficiency of inserting and collating sequences based on the ibutterfly network was proposed ,and also the improved algorithm and implementation of GRP was provided to overcome the de‐fect existed in GRP algorithm .Finally the work efficiency of the improved algorithm was demonstrated by the simulation tools of Matlab ,and the performance of the implementation of GRP was evaluated by the synthesis tool of the Design Complier .The re‐sult shows that the plan can effectively accelerate the speed of GRP algorithm at the expense of increasing the implementation area by 8？2% ,which verifies the rationality of the improved programs .

关 键 词：插入排序 ibutterfly网络 GRP算法 评估策略 改进算法 

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