摘要
adhoc网是一种新型无线移动网络,内部节点相互合作信任,但是没有中心控制节点,且节点的计算资源非常受限。针对如何在这种自组织群体中进行密钥协商,实现安全通信,提出了一种适合adhoc网的认证密钥协商方案,每个节点仅需2n-2次模乘法运算,且仅需一轮通信,其中n是adhoc网中的节点数。经对比该方案的效率远远高于现有方案。
As a new type of wireless mobile network, ad hoc network enjoys cooperative and trustful domain nodes without centralized control unit. Furthermore, the computation capabilities of nodes are very limited. How to exchange a secret key to conduct confidential communication in such an environment attracts much attention in recent years. This paper proposes a novel authenticated key agreement scheme applicable for ad hoc networks. Each node only needs 2n-2 modular multiplication operation and 1 round communication,where n is the nuwber of nodes,with efficiency being much higher than that of the existing scheme.
出处
《西安理工大学学报》
CAS
2005年第1期38-41,共4页
Journal of Xi'an University of Technology
基金
国家973重大项目资助(G1999035804)
国家自然科学基金资助项目(60073052)。
关键词
AD
HOC网
密钥协商
对等群体
网络安全
ad hoc network
key agreement
peer-to-peer group
network security
