论文部分内容阅读
为了解决目前无线Ad-hoc网络安全路由协议中的签名算法运算效率较低,从而导致可实现性较差的问题,借鉴多维Hash链的思想,提出一种数字签名算法,并基于这种数字签名算法,给出一套无线Ad-hoc安全路由协议的实例。该数字签名算法通过RSA(Rivest,Shamir,Adleman)体制中的模幂运算构造多维Hash链,形成公私钥对,对消息进行签名。通过减小模幂运算中指数的大小,达到降低运算量目的。实验结果表明:当密钥长度取1024bit时,该签名算法与RSA签名体制相比,运算量减小约20%,而其安全性依赖于RSA体制的安全性以及使用的Hash函数的安全性。该算法及协议使得无线Ad-hoc网络中路由安全的部署的可实现性得到一定的提高。
In order to solve the problem that the signature algorithm in wireless Ad-hoc network security routing protocol is inefficient at present, which leads to the problem of poor implementability, this paper proposes a digital signature algorithm based on the idea of multi-dimensional Hash chain. Based on this digital signature Algorithm, gives a set of examples of wireless Ad-hoc secure routing protocols. The digital signature algorithm constructs a multi-dimensional Hash chain through modular exponentiation in the RSA (Rivest, Shamir, Adleman) system to form a public-private key pair and sign the message. By reducing the exponentiation in modular exponentiation, the goal of reducing computational complexity is achieved. The experimental results show that when the key length is 1024bit, the computational complexity is reduced by about 20% compared with the RSA signature scheme, and its security depends on the security of the RSA scheme and the security of the Hash function. The algorithm and protocol make the deployment of routing security in wireless Ad-hoc networks be improved.