Secret Common Randomness from Routing Metadata In AdHoc Networks

Building up secret common randomness between two or multiple devices in a network lives at the root of communication security. In its most frequent form of key establishment, the problem is traditionally decomposed into a randomness generation stage (randomness purity is subject to employing often costly true random number generators) and an information-exchange agreement stage, which relies either on public-key infrastructure or on symmetric encryption (key wrapping). In this paper, we propose a secret common randomness for specially appointed network adhoc systems, which works by reaping haphazardness specifically from the network routing metadata, in this way accomplishing both pure randomness generation and (certainly) secret key understanding. Our algorithm relies on the route discovery phase of an ad hoc network employing the dynamic source routing protocol, is lightweight, and requires relatively little communication overhead. The algorithm is evaluated for various network parameters in an OPNET ad hoc network simulator. Our results show that, in just 10 min, thousands of secret random bits can be generated network-wide, between different pairs in a network of 50 users.