What is true randomness, and what quantum actually adds
Unpredictability and statistical uniformity are different properties, and only one of them matters for cryptography. A stream can pass every statistical test ever devised and still be entirely predictable. What quantum physics adds is not better statistics but a source whose unpredictability follows from a model you can state and check.
Two properties that get confused
Statistical uniformity means the output has no detectable bias or correlation. Unpredictability means an observer cannot guess the next bit better than chance, even knowing everything about how the generator is built. These are not the same, and cryptography needs the second.
The clearest demonstration is a counter encrypted under a fixed key. The output is uniform by every measure. It is also completely determined. Statistical tests are useful for catching a broken source; they cannot establish that a working one is unpredictable.
What "true" is doing in the phrase
The phrase "true randomness" usually means "from a physical process rather than an algorithm". That is a meaningful distinction, but it is worth being precise about what it buys, because on its own the answer is: not much. A physical process you cannot model is a process whose entropy you cannot estimate, and an entropy estimate is what a certification body, an auditor or a careful architect will ask for.
This is why we avoid the unqualified phrase. Every entropy estimate on this site is conditional on a stated model of the source. That is not a hedge — it is the only form in which the claim is meaningful. Min-entropy is the measure, and an estimate is not a guarantee.
What quantum actually adds
A quantum process is unpredictable as a consequence of the physics, not as a consequence of being complicated. That makes two things possible. You can write down a model of where the randomness comes from and defend it. And you can identify which measurable quantities the model depends on, which means you can monitor them while the system runs rather than characterising the device once and hoping.
That second consequence is the more valuable one commercially, and it is the basis of the distinction between a characterised source and an observable one.
Keep reading
- Fundamentals
What is a CSPRNG, and where the DRBG fits
A CSPRNG is a deterministic algorithm that expands a seed into a long stream, built so that observing part of the output does not let an attacker compute the rest. In the NIST vocabulary the mechanism is a DRBG, and it sits downstream of an entropy source that seeds and reseeds it.
- Fundamentals
Hardware RNG or software RNG, asking the question properly
The useful question is not hardware versus software but where unpredictability physically originates and what evidence exists about it. Every practical system uses both: a physical source to seed, and a deterministic algorithm to expand. The distinction that matters is whether the physical half is characterised or merely assumed.
- Fundamentals
QRNG vs TRNG vs PRNG, the differences that matter in production
A PRNG expands a seed, a TRNG measures a physical process, and a QRNG measures a quantum one. The difference that matters in production is not speed but evidence: a quantum source can be described by a physical model, which makes its entropy estimate something you can argue about rather than assert.