对DES线性攻击的综合方法  

Synthesis Algorithm for Linear Cryptanalysis of DES

作　　者：燕善俊[1] 

机构地区：[1]徐州工程学院计算科学系,江苏徐州221008

出　　处：《信息安全与通信保密》2006年第10期89-91,共3页Information Security and Communications Privacy

摘　　要：论文分析了在DES的线性攻击过程中候选密钥总量与第一候选密钥正确率之间的关系,给出了DES的另外两个较好的14轮线性逼近。参考多重线性逼近的方法,结合两个较好的线性逼近和最佳线性逼近,提出了能提高攻击DES速度的综合算法A。To analyze the relationship between the number of key-candidates and the success probability of the first key-candidate during the linear cryptanalysis of DES, and propose another two good 14-round linear approximations. Considering the multiple linear approximations method, we present synthesis algorithm-A by using the two linear approximations and the best linear approximations in the same time. It will improve the speed of attacking DES.

关 键 词：线性逼近 相关系数 多重线性逼近 

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