A secure routing protocol with limited key distribution and double message hashing

In this paper we present a new algorithm to secure routing protocols by using limited key distribution and double message hashing, in which each LSA message sent out and received by a router is encrypted by two cryptographic hash functions, one for its hop-one neighbors, another for its hop-two neighbors. The advantages of this algorithm over existing secure routing protocols are its computational efficiency and the ability to detect if there are two rogue routers colluding with each other and within two hops. The proposed algorithm can be used in both distance-vector and link-state routing protocols, such as RIP, OSPF and BGP.