基于Feistel结构的超轻量级分组密码算法(PFP)  

Ultra-lightweight Block Cipher Algorithm(PFP)Based on Feistel Structure

作　　者：黄玉划[1,2] 代学俊[1] 时阳阳[1] 刘宁钟[1] 曾庆喜[3] 苏菲 HUANG Yu-hua DAI Xue-jun SHI Yang-yang LIU Ning-zhong ZENG Qing-xi SU Fei(College of Computer Science and Technology, Nanjing University of Aeronautics ＆ Astronautics, Nanjing 211106, China College of Energy and Power Engineering, Nanjing University of Aeronautics ＆ Astronautics, Nanjing 210016 ,China Suzhou Chinsdom Co. Ltd. ,Suzhou 215500,China)

机构地区：[1]南京航空航天大学计算机科学与技术学院,南京211106 [2]苏州中科启慧软件技术有限公司,苏州215500 [3]南京航空航天大学能源与动力学院,南京210016

出　　处：《计算机科学》2017年第3期163-167,共5页Computer Science

基　　金：江苏省科技支撑计划项目(BE2013879);国家自然科学基金项目(61375021);江苏省自然科学基金项目(SBK201322136);南京航空航天大学青年科技创新基金项目(NS2010097)资助

摘　　要：面向无线终端资源受限环境对加密算法的应用需求,借鉴PRESENT算法的设计思想,采用Feistel结构,并修改扩散层的P置换,设计了一种超轻量级分组密码算法PFP。其硬件实现需要1355GE,优于PRESENT算法,满足资源极端受限环境的需求(2000GE以下)。速度测试结果表明,PFP算法的软件实现效率约为PRESENT算法的1.5倍。依赖性测试、线性分析、差分分析、不可能差分分析和密钥编排攻击表明,PFP算法满足轻量级分组密码的安全需求。To meet the application requirement for cipher algorithms in the resource-constrained terminal system such as the limited energy supply etc,an ultra-lightweight block cipher named PFP was designed by using the experience of PRESENT algorithm for reference. The iterative structure of PFP algorithm is Feistel structure. Its permutation was modified in diffusion layer. It requires only 1355GE with hardware implementation of PFP algorithm, which is better than the PRESENT. And it also fulfills the requirement of environment with extremely constrained resource （no more than 2000GE）. Test results show that the speed of PFP algorithm is about 50% faster than PRESENT. Depen-dence test, linear analysis, differential analysis,impossible differential analysis and key schedule attack show that the PFP al- gorithm can satisfy the security requirements of the lightweight block cipher algorithm.

关 键 词：轻量级分组密码 FEISTEL结构 PRESENT算法 依赖性测试 密码分析 

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