Secure Overlay Routing Using Key Pre-Distribution a Linear Distance Optimization Approach

Abstract

Key pre-distribution algorithms have recently emerged as effective key management alternatives in today’s secure communications landscape.Secure routing techniques using key pre-distribution algorithms require special algorithms capable of finding optimum secure overlay paths.To the best of our knowledge, the literature of key pre-distribution systems still faces a major gap in proposing optimal overlay routing algorithms.

CRYPTOGRAPHY, as a cornerstone of secure communication, requires the use of effective key management algorithms in conjunction with routing algorithms.

Saving such a large number of keys in large networks is not efficient if it is at all practical. Key pre-distribution schemes, in particular the recently proposed all attempts to offer more effective alternatives that require less resources.A key pool for key pre-distribution schemes built on the basis of symmetric cryptography concepts contains secret pair keys.

Conclusion

Projects on Secure Overlay Routing proposed an optimal pre-distribution secure overlay routing method and resolved the associated boolean LP problem in polynomial time.

We noted the main advantage of our algorithm as being able to solve the optimal routing problem for any graph that is either directed or undirected as well as weighted or unweighted.

The results showed that the use of the proposed algorithm has a significant impact on improving a variety of performance metrics, i.e. decreasing average FTP completion time, reducing routing control traffic, increasing throughput, and improving decryption and encryption energy consumption.

The results also showed that using our algorithm increases the network’s security strength by decreasing the number of intermediate decryption steps,projects on Secure Overlay Routing thus significantly reducing the need for additional nodes to be trusted.

We conclude this section by discussing the applications of interest for our work. We see our work as a more practical alternative for use in secure network routing applications that require key distribution.