计算机工程与应用 ›› 2007, Vol. 43 ›› Issue (8): 118-120.

• 网络、通信与安全 • 上一篇    下一篇

多重线性密码分析中线性逼近方程的构造

王建华 怀进鹏   

  1. 空军电子技术研究所 北京航空航天大学计算机科学与工程系
  • 收稿日期:2006-05-17 修回日期:1900-01-01 出版日期:2007-03-11 发布日期:2007-03-11
  • 通讯作者: 王建华

Construction of linear approximation equations in multiple linear cryptanalysis

JianHua Wang   

  • Received:2006-05-17 Revised:1900-01-01 Online:2007-03-11 Published:2007-03-11
  • Contact: JianHua Wang

摘要: 到目前为止,还没有利用构造多个逼近方程来实现B.S.Kaliski和M.J.B.Robshaw的多重线性逼近的例子.本文利用Mastui构造的线性组合传递链是周期为8的线性组合传递链这个特点,选取该线性组合传递链的8个不同起点,就可由该线性组合传递链构造出8条新的线性组合传递链,再加上其对偶的线性组合传递链,共可构造出16条线性组合传递链,利用它们可实现对DES的密钥比特进行攻击.

Abstract: Until now, multiple linear cryptanalysis proposed by B.S.Kaliski and M.J.B.Robshaw has not been realized by multiple linear approximation equations, The paper selects eight different start points in linear combinational pass chain which period is eight and is constructed by Mastui. This linear combinational pass chain constructs eight new chains, then plus its dual chains, gets totally sixteen chains; finally, key bits of DES can be attacked by these chains.