Randomness analysis of end-to-end delay in random forwarding networks

Area of Science:

• Computer Science
• Network Security
• Cryptography

Background:

• Random forwarding networks are crucial for network security and load balancing.
• End-to-end delay in these networks is a readily available random quantity.
• This delay can serve as a valuable random source for cryptographic applications.

Purpose of the Study:

• To develop a mathematical model for random forwarding networks.
• To analyze the end-to-end delay distribution and its randomness.
• To identify and quantify factors limiting delay randomness and propose optimization strategies.

Main Methods:

• Mathematical modeling of random forwarding networks.
• Calculation of end-to-end delay distribution.
• Development of a Symbol Matrix-based algorithm to calculate inevitable delay collisions.
• Derivation of optimal node forwarding strategies for maximum delay randomness.

Main Results:

• End-to-end delay collision across different forwarding routes significantly reduces randomness.
• Network deployment optimization can mitigate some collisions.
• An algorithm using Symbol Matrix effectively quantifies unavoidable collisions.
• Optimal forwarding strategies are identified to maximize delay randomness.

Conclusions:

• The end-to-end delay in random forwarding networks is a viable source for cryptographic randomness.
• Understanding and mitigating delay collisions are key to enhancing randomness.
• The proposed methods and algorithms enable the optimization of network randomness for applications like symmetric key generation.