Entropy Mixing Networks: Enhancing Pseudo-Random Number Generators with Lightweight Dynamic Entropy Injection
Random number generation plays a vital role in cryptographic systems and computational applications, where uniformity, unpredictability, and robustness are essential. This paper presents the Entropy Mixing Network (EMN), a novel hybrid random number generator designed to enhance randomness quality b...
Gespeichert in:
Hauptverfasser: | , , , , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | Random number generation plays a vital role in cryptographic systems and
computational applications, where uniformity, unpredictability, and robustness
are essential. This paper presents the Entropy Mixing Network (EMN), a novel
hybrid random number generator designed to enhance randomness quality by
combining deterministic pseudo-random generation with periodic entropy
injection. To evaluate its effectiveness, we propose a comprehensive assessment
framework that integrates statistical tests, advanced metrics, and visual
analyses, providing a holistic view of randomness quality, predictability, and
computational efficiency. The results demonstrate that EMN outperforms Python's
SystemRandom and MersenneTwister in critical metrics, achieving the highest
Chi-squared p-value (0.9430), entropy (7.9840), and lowest predictability
(-0.0286). These improvements come with a trade-off in computational
performance, as EMN incurs a higher generation time (0.2602 seconds). Despite
this, its superior randomness quality makes it particularly suitable for
cryptographic applications where security is prioritized over speed. |
---|---|
DOI: | 10.48550/arxiv.2501.08031 |