How much entropy does cryptography actually need?
Entropy demand is calculable: DRBG instances multiplied by seed size divided by reseed interval, plus whatever consumes entropy directly, plus headroom for bursts. For most systems the answer is far below what a hardware source produces, which is exactly why sizing honestly is more useful than quoting a peak rate.
The calculation
Start from consumption rather than production. Count DRBG instances — one per core, per process or per connection depending on your library. Multiply by seed size. Divide by reseed interval. That is your steady-state floor in bits per second.
Then add direct consumers: anything drawing entropy without going through a DRBG, such as key generation in an HSM configured to draw fresh material per operation, or device provisioning at manufacture.
The number that actually breaks systems
Steady state is easy. The burst is not. After an outage every client reconnects at once and every session re-establishes simultaneously, so demand for a few seconds can be one or two orders of magnitude above average.
A system sized to its average is a system that was comfortable for a year and fails on the worst day, which is also the day the failure is least welcome. Size to the reconnection storm, not the mean.
Worked shape
A TLS-terminating tier with a few hundred DRBG instances reseeding every few minutes consumes a rate measured in kilobits per second. A certificate authority signing continuously, or a manufacturing line provisioning device identities, can consume orders of magnitude more. Both are far easier to reason about once written down.
The point of the arithmetic is usually to discover that throughput is not your constraint — which frees the conversation to be about evidence instead, where it belongs. The pillar-1 treatment of throughput approaches the same calculation from the hardware side.
What headroom is for
Not just bursts. Sources degrade, and a design running at the edge of its entropy budget has no margin for a source delivering less than its modelled rate. Headroom is what lets a health-test failure be an alarm rather than an outage.
Keep reading
- Entropy fundamentals
Entropy conditioning, pools and reseeding
Conditioning compresses raw entropy-source output so the result carries close to full entropy per bit, usually with a hash or block-cipher construction. Reseeding policy then decides how often that material refreshes the DRBG — an architecture decision that governs how long a state compromise stays exploitable.
- Entropy fundamentals
What is an entropy source? Source, RNG and DRBG
An entropy source is the physical component that produces unpredictability. An RNG is the complete construction that turns that into usable output. A DRBG is the deterministic algorithm inside it that expands a seed. The three are routinely conflated, and untangling them makes the SP 800-90 series readable.
- Entropy fundamentals
Entropy vs randomness, a distinction that matters
Randomness describes how output looks; entropy measures how much unpredictability is actually present. A stream can be perfectly random-looking and contain no entropy at all — which is precisely what a good pseudorandom generator produces, and why statistical testing cannot establish security.