WSN中基于乱序多项式对偶密钥的攻击方案

Attacking scheme against the permutation-based multi-polynomial scheme for pair-wise key establishment in wireless sensor networks

针对Guo等的WSN中基于乱序对称多项式的对偶密钥方案提出一种攻击方案。通过构造黑盒的方式,对多项式进行攻击,通过整体求解多项式集合,而不是求解单个多项式的方式,使多项式的排列顺序在多项式的破解中失去作用,从而实现乱序多项式的破解。定理证明和实例分析表明Guo等的方案不能抵御大规模节点俘获攻击,未能突破多项式的容忍门限,是一种不安全的方案。

An attacking scheme was proposed against the permutation-based multi-polynomial scheme proposed by Guo, et al for pair-wise key establishment in wireless sensor networks. Attacks on polynomials were carried out by construct- ing a black-box to integrally solve the set of polynomials rather than a single polynomial. The results show that this scheme can break the symmetric polynomials and make the permutation of polynomials lose its function. The proven theorems and instance analysis indicate that the scheme proposed by Guo, et al can＇t frustrate the large-scale node capture attack and can＇t break the tolerance threshold of polynomials. Therefore, the scheme is insecure.