基于对称矩阵分解的无线传感网密钥恢复攻击  

WSN key recovery attack based on symmetric matrix decomposition

作　　者：纪祥敏[1,2] 赵波[1] 刘金会 贾建卫 张焕国[1] 向騻 JI Xiangmin;ZHAO Bo;LIU Jinhui;JIA Jianwei;ZHANG Huanguo;XIANG Shuang(Key Laboratory of Aerospace Information Security and Trusted Computing,Ministry of Education,School of Cyber Science and Engineering,Wuhan University,Wuhan 430072,China;College of Computer Information Science,Fujian Agriculture and Forestry University,Fuzhou 350002,China;School of Computer Science,Shaanxi Normal University,Xi’an 710119,China;Huawei Technologies Co.,Ltd.,Xi’an 710075,China;Yangtze River Engineering Supervision Consulting Co.,Ltd.,Wuhan 430015,China)

机构地区：[1]武汉大学国家网络安全学院空天信息安全与可信计算教育部重点实验室,湖北武汉430072 [2]福建农林大学计算机与信息学院,福建福州350002 [3]陕西师范大学计算机科学学院,陕西西安710119 [4]华为技术有限公司,陕西西安710075 [5]长江工程监理咨询有限公司,湖北武汉430015

出　　处：《通信学报》2018年第10期87-96,共10页Journal on Communications

基　　金：国家重点基础研究发展计划("973"计划)基金资助项目(No.2014CB340600);国家高技术研究发展计划("863"计划)基金资助项目(No.2015AA016002);国家自然科学基金重点项目资助项目(No.61332039);中央高校基本科研业务费基金资助项目(No.GK201803061);中国博士后科学基金面上项目基金资助项目(No.2018M631121);福建省自然科学基金资助项目(No.2016J01285)~~

摘　　要：密钥协议是保障无线传感网络(WSN, wireless sensor network)安全性的关键技术之一。Parakh等基于矩阵分解提出一种传感网密钥协议,然而研究表明该协议存在安全隐患。利用对称矩阵和置换矩阵性质,提出针对该协议的密钥恢复攻击方法。在截获节点行、列向量信息基础上,进行初等变换,构造线性代数攻击算法,求解出等价密钥,计算复杂度为O(N6)。实验结果表明,在多项式计算复杂度内,该方法可恢复出上述协议的等价密钥,内存开销在可接受范围内。此外,为了抵抗线性代数攻击,通过引入随机扰动矩阵,给出一种密钥协商修正方案,并进行了正确性与安全性分析。The key protocol is one of the crucial technologies to ensure the security for wireless sensor network(WSN).Parakh,et al.proposed a key agreement for WSN based on matrix decomposition.However,the study revealed that the protocol had security risks.A key recovery attack scheme against this protocol was proposed by using the properties of symmetric matrix and permutation matrix.Based on intercepting the row and column vector of the node,elementary transformation was performed to construct a linear algebraic attack algorithm and the equivalent key was obtained.The computational complexity is O(N6).Experimental results show that the method can recover the equivalent key of the above protocol within the polynomial computational complexity and the memory consumption is within an acceptable range.In addition,an improved scheme for key agreement was proposed to resist the linear algebraic attack by using a random disturbance matrix,and the correctness and security analysis were also carried out.

关 键 词：密钥协议 密钥恢复 矩阵分解 齐次线性方程组求解 无线传感网络 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]