摘要： 对偶密钥机制，使得网络中任意两个节点共享预置的密钥，在传感器网络的安全中具有非常重要的意义。由于节点资源受限，如何尽可能减小建立间接对偶密钥的路径长度是该类算法的研究焦点之一。该文提出了一种基于超立方体模型的对偶密钥快速建立算法，采用对二进制串分段及逻辑运算等处理来消并一定数量的异位数目，从而在较大程度上减少生成密钥路径的中间节点。

关键词: 对偶密钥；传感器网络；密钥预置；超立方体模型

Abstract: The pairwise key scheme, which enables any two nodes to share a common key, plays a key role in sensor networks security. Due to node resource constraints, research focuses on achieving minimum path length of indirect pairwise key construction. A fast algorithm on pairwise key establishment is presented, based on the hypercube model. The improved algorithm can effectively reduce the number of different bits between any two nodes by means of subsection on binary strand and boolean calculation, thus evidently reduces the number of intermediate nodes on created key path .

Key words: Pairwise key; Sensor networks; Key pre-distribution; Hypercube model