IID-Based QPP-RNG: A Random Number Generator Utilizing Random Permutation Sorting Driven by System Jitter
Randy Kuang, Dafu Lou

TL;DR
This paper introduces a novel IID-based RNG that combines quantum permutation pads with system jitter to produce high-quality, non-deterministic random numbers suitable for cryptography, surpassing existing QRNGs in entropy quality.
Contribution
The paper presents a new RNG design that uses system jitter to generate permutation pads and directly derives 8-bit outputs, eliminating post-processing and achieving superior entropy.
Findings
Achieves min-entropy of 7.85-7.95 bits per byte, exceeding QRNG standards.
Produces uniformly distributed outputs across multiple platforms.
Demonstrates high Shannon entropy of 7.9999 bits per byte in evaluations.
Abstract
We propose a groundbreaking random number generator that achieves truly uniform, independent, and identically distributed (IID) randomness by integrating Quantum Permutation Pads (QPP) with system jitter--derived entropy, herein called IID-based QPP-RNG. Unlike conventional RNGs that use raw timing variations, our design uses system jitter solely to generate ephemeral QPP pads and derives 8-bit outputs directly from permutation counts, eliminating the need for post-processing. This approach leverages the factorial complexity of permutation sorting to systematically accumulate entropy from dynamic hardware interactions, ensuring non-deterministic outputs even from fixed seeds. Notably, IID-based QPP-RNG achieves a min-entropy of 7.85-7.95 bits per byte from IID min-entropy estimate, surpassing ID Quantique's QRNG (7.157042 bits per byte), which marks a breakthrough in randomness quality.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
