一类基于混沌函数的分组密码的安全性评估  

Security Evaluation for a Class of Block Ciphers Based on Chaotic Maps

作　　者：张文涛[1,2] 卿斯汉[1,2] 吴文玲[1,2] 

机构地区：[1]中国科学院软件研究所,北京100080 [2]中国科学院信息安全技术工程研究中心,北京100080

出　　处：《软件学报》2003年第3期512-517,共6页Journal of Software

基　　金：Supported by the National Natural Science Foundation of China under Grant Nos.60103023; 60083007 (国家自然科学基金); the National Grand Fundamental Research 973 Program of China under Grant No.G1999035810 (国家重点基础研究发展规划(973))

摘　　要：评估了一类基于混沌函数的分组密码(generalized Feistel structure,简称GFS)抵抗差分密码分析和线性密码分析的能力.如果轮函数是双射且它的最大差分特征概率和线性逼近概率分别是p和q,则r轮GFS的最大差分特征和线性逼近的概率分别以pr-1和qr-1为其上界.The security evaluation of a class of block ciphers based on chaotic maps against differential and linear attacks is studied. If the round function is bijective and its maximum differential and linear characteristic probabilities are p and q respectively, the upper bounds of maximum differential and linear characteristic probabilities for r rounds are pr-1 and qr-1 respectively.

关 键 词：混沌函数 分组密码 安全性 评估 密码学 

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