Quantum-safe cryptographic protocols require certified entropy for key generation, nonces, and ephemeral parameters. Existing hardware and quantum random number generators impose deployment costs, supply-chain risks, and rely on heuristic post-processing. We present a mathematically certified, software-defined entropy source—a true random number generator (TRNG)—that produces uniform randomness with a provable min-entropy lower bound via computational jitter modulation, without specialized hardware or external conditioning. The core contribution is the Geometric Convergence Theorem (GCT): the modular reduction of a Compound Negative Binomial (CNB)-distributed observable converges exponentially to an invariant uniform measure over finite cyclic groups, with an explicit, computable spectral decay factor and a matching min-entropy lower bound. The GCT is complemented by the Stochastic Uncertainty Principle (SUP), an exact coefficient-of-variation decomposition that quantifies physical entropy injection from microarchitectural jitter. Together they yield a two-layer architecture: the combinatorial layer carries an exact, platform-independent uniformity bound, and the physical layer supplies the fresh entropy through continuous reseeding, so that the certified output is TRNG-class rather than a deterministic PRNG stream. The framework is validated through the Random Permutation Sorting System (RPSS) on commodity hardware, implemented in C with intentional compiler anti-optimization to maximize jitter. Empirical results confirm the theorem’s predictions, achieving Shannon entropy of 7.999997 bits/byte and min-entropy of 7.992 bits/byte over 100 MB of samples, with these values reproducible across three independent long-duration runs spanning a nearly 500× range in physical volatility, and directly from raw modular outputs without post-processing. This establishes a platform-agnostic, mathematically certified foundation for software-defined entropy generation, with direct implications for FIPS 140-3 post-quantum cryptographic infrastructure and entropy sovereignty.
Quantum-safe cryptographic protocols require certified entropy for key generation, nonces, and ephemeral parameters. Existing hardware and quantum random number generators impose deployment costs, supply-chain risks, and rely on heuristic post-processing. We present a mathematically certified, software-defined entropy source—a true random number generator (TRNG)—that produces uniform randomness with a provable min-entropy lower bound via computational jitter modulation, without specialized hardware or external conditioning. The core contribution is the Geometric Convergence Theorem (GCT): the modular reduction of a Compound Negative Binomial (CNB)-distributed observable converges exponentially to an invariant uniform measure over finite cyclic groups, with an explicit, computable spectral decay factor and a matching min-entropy lower bound. The GCT is complemented by the Stochastic Uncertainty Principle (SUP), an exact coefficient-of-variation decomposition that quantifies physical entropy injection from microarchitectural jitter. Together they yield a two-layer architecture: the combinatorial layer carries an exact, platform-independent uniformity bound, and the physical layer supplies the fresh entropy through continuous reseeding, so that the certified output is TRNG-class rather than a deterministic PRNG stream. The framework is validated through the Random Permutation Sorting System (RPSS) on commodity hardware, implemented in C with intentional compiler anti-optimization to maximize jitter. Empirical results confirm the theorem’s predictions, achieving Shannon entropy of 7.999997 bits/byte and min-entropy of 7.992 bits/byte over 100 MB of samples, with these values reproducible across three independent long-duration runs spanning a nearly 500× range in physical volatility, and directly from raw modular outputs without post-processing. This establishes a platform-agnostic, mathematically certified foundation for software-defined entropy generation, with direct implications for FIPS 140-3 post-quantum cryptographic infrastructure and entropy sovereignty.
Existing randomness conditioning methods face a fundamental dilemma: one must choose between heuristic post-processing, which is practical but lacks rigorous mathematical uniformity guarantees, and provable seeded extractors, which offer information-theoretic guarantees but require an independent perfectly uniform seed—thereby shifting, rather than eliminating, the underlying trust assumption. Neither option alone achieves provable uniformity from a raw physical source. We present a universal, mathematically certified conditioning framework that resolves this dilemma. For any NIST SP 800-90B ESV-certified entropy source, regardless of bias or implementation, our framework generates a provably uniform output stream without requiring any external seed or heuristic whitening. The core contribution is the Geometric Convergence Theorem (GCT), proving that the modular reduction of a negative binomial counting variable Np∼NB(m,p)—where m denotes the required number of successes generated from fixed ESV entropy blocks via Bernoulli trials with success probability p—converges exponentially to uniformity over ZR, with spectral radius ρNB=p/p2+4(1−p)sin2(π/R)<1. A Practical Entropy Budgeting mechanism ensures information-theoretic entropy conservation via a fixed input–output ratio. In a large-scale validation generating 100 MB of output from a biased ESV source (Hin=3.32 bits/byte), the framework achieved Shannon entropy 7.999998 bits/byte and min-entropy 7.9936 bits/byte, approaching the theoretical lower bound of 7.9949 bits/byte to within 0.0013 bits/byte, with χ2=275.95 (df = 255). This establishes the first seedless, provable, and platform-agnostic conditioning framework for certified entropy sources.
We introduce the random permutation sorting system (rpss), a software-defined framework that generates high-quality, uniform randomness by leveraging a statistical model with properties analogous to quantum ensembles. The RPSS operates as a self-contained entropy engine based on a fundamental pair of conjugate observables: the permutation count (N[over ̂]_{p}) and the elapsed sorting time (T[over ̂]). While the raw distributions of these observables are highly right-skewed and heavy-tailed, we provide a mathematical proof of their synchronous convergence to uniformity. The permutation count distributions follow a negative binomial model, and the observed modes for different repetition parameters m closely match the theoretical predictions, confirming the validity of the model. This convergence arises from the compounded effect of permutation counts on elapsed time and a process of modular uniformization, in which a vast number of microstates-stemming from combinatorial complexity and intrinsic system-level jitter-map onto a finite set of uniform symbols. This mechanism enables the RPSS to function as a true uniform random number generator. We implemented the RPSS as the qpp-rng, a practical software realization that autonomously harvests entropy from a platform's intrinsic microarchitectural dynamics. Unlike prior benchmark-focused studies, this work provides a deep theoretical and experimental investigation of the underlying physical mechanism. Empirical validation confirms our predictions, demonstrating rapid entropy convergence and statistically uniform outputs, as assessed by NIST SP 800-90B min-entropy and χ-squared statistics, consistent with central-limit-theorem expectations. The RPSS establishes a class of quantum-inspired ecocryptosystems, in which randomness is simultaneously harvested from unpredictable hardware behavior and amplified through a combinatorial process. This dual-source approach provides a compact, self-stabilizing entropy engine suitable for foundational applications in cryptography, blockchain protocols, and digital currency systems, offering a robust, platform-agnostic alternative to conventional entropy sources.
We present a fully digital framework that replicates the statistical behavior of coherent-state quantum random number generation (QRNG) by harnessing system timing jitter through random permutation processes. Our approach transforms computational timing variations from hardware and operating system sources into permutation dynamics that generate Poisson-distributed numbers, accurately reproducing the photon statistics of optical coherent states. The theoretical foundation is established by the Uniform Convergence Theorem, which provides exponential convergence to uniformity under modular projection with rigorous error bounds. Extensive experimental validation across multiple parameter regimes and sample sizes up to 108 bytes demonstrates exceptional performance: Shannon entropy approaching 7.999998 bits/byte and min-entropy exceeding 7.99 bits/byte, outperforming theoretical bounds at scale. The architecture inherently resists side-channel attacks through compound timing distributions and adaptive permutation behavior, while operating without classical cryptographic post-processing. Our results establish that coherent-state QRNG functionality can be entirely realized through classical computational processes, delivering mathematically provable uniformity and practical cryptographic security without quantum photonic hardware.
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 minentropy estimate, surpassing ID Quantique's QRNG (7.157042 bits per byte), which marks a breakthrough in randomness quality. Our implementation employs a dynamic seed evolution protocol that continuously refreshes the internal state with unpredictable system jitter, effectively decoupling the QPP sequence from the initial seed. Cross-platform validation on macOS (x86 and ARM) and Windows (x86) confirms uniformly distributed outputs, while evaluations compliant with NIST SP 800-90B show a Shannon entropy of 7.9999 bits per byte. Overall, IID-based QPP-RNG represents a significant advancement in random number generation, offering a scalable, system-based, software-only, postquantum secure solution for a wide range of cryptographic applications.
We propose and experimentally demonstrate the quasi-superposition quantum-inspired system (QSQS)-a conceptual quantum system for randomness generation built on measuring two conjugate observables of a permutation sorting process: the deterministic permutation count n_{p} and the fundamentally nondeterministic sorting time t. By analogy with quantum systems, these observables are linked by an uncertainty-like constraint: algorithmic determinism ensures structural uniformity, while system-level fluctuations introduce irreducible unpredictability. We realize this framework concretely as a quantum permutation pad (QPP) random number generator (RNG) or QPP-RNG, a system-embedded, software-based true random number generator (TRNG). In QPP-RNG, real-time measurements of sorting time t-shaped by CPU pipeline jitter, cache latency, and OS scheduling-dynamically reseed the pseudorandom RNG, driving the permutation sequence. This design fuses deterministic and nondeterministic components, so that entropy emerges organically from the quasisuperposition structure of the system. Crucially, the QSQS transforms initially right-skewed raw distributions of n_{p} and t into nearly uniform outputs after modulo reduction. This effect arises from the system's internal degeneracies: many distinct internal states collapse into the same output symbol, effectively flattening biases and filling out the output space. This transformation from biased measurements to uniform randomness is the core principle of the QSQS. Empirical results show that as the repetition factor m increases, output entropy converges toward theoretical maxima: Shannon and NIST SP 800-90B min-entropy values approach 8 bits, chi-squared statistics stabilize near ideal uniformity, and bell curve plots visually confirm the flattening from skewed to uniform distributions. The convergence to uniformity occurs at a rate inversely proportional to the size of the permutation space, making the system both scalable and theoretically grounded. Beyond practical implications, our findings illustrate how the QSQS unifies deterministic algorithmic processes with nondeterministic physical fluctuations in a single framework, offering a physics-based perspective for engineering randomness. In the quantum-safe era, the QPP-RNG can close the entropy gap by embedding true randomness directly into cryptographic modules, reducing reliance on external entropy sources and enabling entropy-rich, self-contained postquantum cryptographic ecosystems.
True random number generation is a critical capability for fault-tolerant quantum computing at millikelvin temperatures. Yet existing Josephson-junction-based TRNGs all rest on a widely accepted but untested assumption: that reliable entropy extraction requires precisely controlled device parameters. Here we show that this assumption does not always hold. We demonstrate a counterintuitive finding: a single current-biased Josephson junction, regardless of its parameter quality, can serve as a cryptographic-grade true random number generator. To establish the universality of this conclusion, we deliberately selected the most extremely deviated devices from fabrication, with critical currents three orders of magnitude away from theoretical predictions and IcR products an order of magnitude above conventional values, as the ultimate stress test. Even under these extreme conditions, the raw Shannon entropy reaches 0.9981~bit (99.8\% of the theoretical maximum), with a min-entropy of 0.9271~bit. Using a square-wave pulsed-bias scheme, we tune the switching probability to P≈0.5. After SHA-256 post-processing, the bitstreams pass all 15 NIST SP 800-22 tests under a conservative m=3 criterion that is more demanding than the standard recommendation, and this certification holds across the entire 100-700~mK operating window of a dilution refrigerator.