Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Cybersecurity and Privacy

A Universal, Provably Uniform Conditioning Framework via Negative Binomial Convergence

Randy Kuang

Published Oct 4, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.3390/jcp6050170

Related papers

Provable Uniformity and Min-Entropy Bounds from Compound Negative Binomial Jitter: A Software-Defined TRNG

Randy Kuang

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.

•Nov 2, 2026•0 citations

Online Adaptive Randomness Extraction for Physical and Quantum Entropy Sources: Composing Health-Test Soundness with the Leftover Hash Lemma

Junyop Choe, Indran Xavier

Physical and quantum random number generators (QRNGs) do not emit uniform bits: detector bias, dead time, after-pulsing, and environmental drift leave their raw output biased, correlated, and partially predictable to an adversary who models the device. Deployable generators therefore include a conditioning (randomness-extraction) stage that distils near-uniform keys from a source of certified min-entropy, and the cryptographic workhorse of that stage is the Leftover Hash Lemma (LHL). This paper analyses two ways in which real deployments depart from the textbook LHL. First, a physical source has no fixed min-entropy: continuous health tests, as standardised in NIST SP 800-90B, produce a runtime lower-bound estimate that varies from block to block and can occasionally be optimistic. Driving the extractor output length from this estimate, we prove an online adaptive extraction theorem whose security bound cleanly composes the estimator soundness error with the extractor error, yielding a (δ+ε)-secure key and separating how often the entropy estimate is optimistic from how uniform the hash output is, as two independently tunable budgets. Second, for settings that publish or reuse the extractor seed — public randomness beacons, reproducible pipelines, and seed-constrained devices — we prove that publishing the seed costs nothing, since this is the defining property of a strong extractor, and that reusing a single seed across m independent source blocks costs at most mε in statistical distance. A corollary bounds the security loss when the extracted key is consumed by a downstream symmetric primitive, and a worked instantiation with realistic QRNG parameters reports the achievable secret-key rate. A reproducible numerical simulation on a synthetic biased source corroborates all four claims. Throughout, we are explicit about the single load-bearing unproven premise — empirical min-entropy certification of the physical device — which belongs to entropy-source validation and lies outside the scope of the analysis.

International Journal of Research and Innovation in Applied Science•Jan 1, 2026•0 citations

Statistical quantum mechanics of the random permutation sorting system: A self-stabilizing true uniform random number generator

Randy Kuang

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.

arXiv:2509.10174•Physical review. E•Jan 16, 2026•2 citations

Certified Randomness with Optimal Rate

Siddhartha Jain, Saachi Mutreja, Bhaskar Roberts

The generation of certified random bits is an emerging near-term application of quantum computers. Potential applications, such as randomness beacons and CRS generation, require nearly uniform randomness, whose rate (the ratio of min-entropy to bitlength) is ~ 1. However, existing protocols for certified randomness either produce weakly random strings with rate o(1), or they require a trusted random seed. We show how to certify randomness with the optimal rate ~ 1 without requiring any trusted randomness from the verifier. Our protocol is secure unconditionally in the quantum random oracle model (QROM). This improves the result of Coladangelo et al., who certified weakly random strings unconditionally in the QROM, and answers a question posed by Aaronson and Hung. We also define and construct a proof of conditional min-entropy, which certifies optimal min-entropy even conditioned on an adversarially chosen transcript. We show an application of this primitive to randomness beacons, where each pulse should have high min-entropy conditioned on all previous messages.

quant-pharXiv:2609.38945•Oct 1, 2026•1 citation

Physical Randomness Extractors: Generating Random Numbers with Minimal Assumptions

Kai-Min Chung, Yaoyun Shi, Xiaodi Wu

How to generate provably true randomness with minimal assumptions? This question is important not only for the efficiency and the security of information processing, but also for understanding how extremely unpredictable events are possible in Nature. All current solutions require special structures in the initial source of randomness, or a certain independence relation among two or more sources. Both types of assumptions are impossible to test and difficult to guarantee in practice. Here we show how this fundamental limit can be circumvented by extractors that base security on the validity of physical laws and extract randomness from untrusted quantum devices. In conjunction with the recent work of Miller and Shi (arXiv:1402:0489), our physical randomness extractor uses just a single and general weak source, produces an arbitrarily long and near-uniform output, with a close-to-optimal error, secure against all-powerful quantum adversaries, and tolerating a constant level of implementation imprecision. The source necessarily needs to be unpredictable to the devices, but otherwise can even be known to the adversary. Our central technical contribution, the Equivalence Lemma, provides a general principle for proving composition security of untrusted-device protocols. It implies that unbounded randomness expansion can be achieved simply by cross-feeding any two expansion protocols. In particular, such an unbounded expansion can be made robust, which is known for the first time. Another significant implication is, it enables the secure randomness generation and key distribution using public randomness, such as that broadcast by NIST's Randomness Beacon. Our protocol also provides a method for refuting local hidden variable theories under a weak assumption on the available randomness for choosing the measurement settings.

arXiv:1402.4797•Feb 19, 2014•87 citations

A low-temperature entropy source for on-chip true random number generation: universal robustness beyond device quality

Y. Q. Chai, M. Y. Wang, X. N. Feng +1 more

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 $I_cR$ 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\approx0.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.

quant-pharXiv:2609.29300•Sep 25, 2026•0 citations
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.
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.
Physical and quantum random number generators (QRNGs) do not emit uniform bits: detector bias, dead time, after-pulsing, and environmental drift leave their raw output biased, correlated, and partially predictable to an adversary who models the device. Deployable generators therefore include a conditioning (randomness-extraction) stage that distils near-uniform keys from a source of certified min-entropy, and the cryptographic workhorse of that stage is the Leftover Hash Lemma (LHL). This paper analyses two ways in which real deployments depart from the textbook LHL. First, a physical source has no fixed min-entropy: continuous health tests, as standardised in NIST SP 800-90B, produce a runtime lower-bound estimate that varies from block to block and can occasionally be optimistic. Driving the extractor output length from this estimate, we prove an online adaptive extraction theorem whose security bound cleanly composes the estimator soundness error with the extractor error, yielding a (δ+ε)-secure key and separating how often the entropy estimate is optimistic from how uniform the hash output is, as two independently tunable budgets. Second, for settings that publish or reuse the extractor seed — public randomness beacons, reproducible pipelines, and seed-constrained devices — we prove that publishing the seed costs nothing, since this is the defining property of a strong extractor, and that reusing a single seed across m independent source blocks costs at most mε in statistical distance. A corollary bounds the security loss when the extracted key is consumed by a downstream symmetric primitive, and a worked instantiation with realistic QRNG parameters reports the achievable secret-key rate. A reproducible numerical simulation on a synthetic biased source corroborates all four claims. Throughout, we are explicit about the single load-bearing unproven premise — empirical min-entropy certification of the physical device — which belongs to entropy-source validation and lies outside the scope of the analysis.
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.
The generation of certified random bits is an emerging near-term application of quantum computers. Potential applications, such as randomness beacons and CRS generation, require nearly uniform randomness, whose rate (the ratio of min-entropy to bitlength) is ~ 1. However, existing protocols for certified randomness either produce weakly random strings with rate o(1), or they require a trusted random seed. We show how to certify randomness with the optimal rate ~ 1 without requiring any trusted randomness from the verifier. Our protocol is secure unconditionally in the quantum random oracle model (QROM). This improves the result of Coladangelo et al., who certified weakly random strings unconditionally in the QROM, and answers a question posed by Aaronson and Hung. We also define and construct a proof of conditional min-entropy, which certifies optimal min-entropy even conditioned on an adversarially chosen transcript. We show an application of this primitive to randomness beacons, where each pulse should have high min-entropy conditioned on all previous messages.
How to generate provably true randomness with minimal assumptions? This question is important not only for the efficiency and the security of information processing, but also for understanding how extremely unpredictable events are possible in Nature. All current solutions require special structures in the initial source of randomness, or a certain independence relation among two or more sources. Both types of assumptions are impossible to test and difficult to guarantee in practice. Here we show how this fundamental limit can be circumvented by extractors that base security on the validity of physical laws and extract randomness from untrusted quantum devices. In conjunction with the recent work of Miller and Shi (arXiv:1402:0489), our physical randomness extractor uses just a single and general weak source, produces an arbitrarily long and near-uniform output, with a close-to-optimal error, secure against all-powerful quantum adversaries, and tolerating a constant level of implementation imprecision. The source necessarily needs to be unpredictable to the devices, but otherwise can even be known to the adversary. Our central technical contribution, the Equivalence Lemma, provides a general principle for proving composition security of untrusted-device protocols. It implies that unbounded randomness expansion can be achieved simply by cross-feeding any two expansion protocols. In particular, such an unbounded expansion can be made robust, which is known for the first time. Another significant implication is, it enables the secure randomness generation and key distribution using public randomness, such as that broadcast by NIST's Randomness Beacon. Our protocol also provides a method for refuting local hidden variable theories under a weak assumption on the available randomness for choosing the measurement settings.
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 IcRI_cRIc​R 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.5P\approx0.5P≈0.5. After SHA-256 post-processing, the bitstreams pass all 15 NIST SP 800-22 tests under a conservative m=3m=3m=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.