[cryptography] Kernel space vs userspace RNG
mgreene at securityinnovation.com
Mon May 9 17:13:30 EDT 2016
Interrupts don't need to be polled in a loop in the kernel, though. As long as the interrupt handler being used to collect the data is quick enough, it wouldn't necessarily need to be resource intensive. There are only going to be 15 or 24 interrupt lines on most x86 systems, anyway. All else being equal, such an interrupt handler in the kernel would actually probably hog less CPU cycles than it would in userspace just because it doesn't need to poll at all for that information.
On May 9, 2016 11:21:18 AM PDT, Russell Leidich <pkejjy at gmail.com> wrote:
>"how do you plan to get notice of them? the very point of DMA is that
>goes on in the background, and then you get a notification."
>Generically speaking, you can't get any such notice due to insufficient
>privilege. The best a userspace TRNG can do is to filter out periodic
>polynomial patterns in the timedelta stream, then hope that the residue
>sufficiently mixed with actual physical entropy, to be secure. But it's
>possible that all that purported entropy is really just the aperiodic
>residue of other deterministic processes running on the machine. So its
>security depends upon the difficulty of (1) isolating cases in which no
>physical entropy affects the output (e.g. cold boot at deterministic
>frequency before bus intitialization, which no sane security engineer
>allow) or (2) inserting enough taps into the machine that despite the
>presence of physical entropy, the output can still be predicted. No
>userspace TRNG can have a rigorous proof of security, for these
>They are an economic compromise, essentially.
>"this is not the question at all. i don't doubt that userspace can see
>entropy. my point was that the kernel sees everything, while userspace
>less. it is not refuted by showing examples of entropy userspace can
>If you mean that the kernel can see randomness which it actually knows
>be entropy, whereas the userspace can only see randomness which may be
>entropy or pseudorandomness, I agree. My point was just that collecting
>most of the physical entropy requires a tight loop. To the extent that
>kernels are willing to sit around for a while doing so, then they can
>gather unlimited amounts of entropy, given a reasonable model of DMA
>skew behavior. However, in practice, kernels hate latency, so userspace
>much better afford to sit around gathering randomness, at the cost of
>knowing how much of that is due to physical entropy.
>"please note that i also pointed out a danger: all the entropy visible
>userspace might be easier to steal, because there is a chance that
>programs can gather the exact same entropy (hence my example of the
>Your sound card noise example makes sense because a single server (the
>audio driver) is broadcasting to multiple clients (parallel userspace
>TRNGs). Fortunately, timedeltas don't work like that. For example, with
>Intel Hyperthreading cores, both virtual cores compete for access to
>ALUs, so they will never show the same timedelta stream for anywhere
>the thousands of cycles required to produce a random number, especially
>after periodicity subtraction. I would actually expect more raw
>stream similarity between successive single-threaded runs, than from a
>of simultaneous runs, on account of this competition. If we're talking
>about physically separate CPUs, it only gets more complicated.
>By the way, I would expect to be able to detect the arrival of an IRQ
>monitoring the timedelta stream in userspace, especially on more idle
>machines. This is one way in which _kernel_ entropy could be stealable.
>Intel provided a means to make RDTSC(P) illegal in userspace (via
>This should be implemented, and the timestamp counter virtualized to
>kernel events, but I don't know of any OS which does that.
>"to some extent, havege might alleviate this, because there is no
>way to observe the parameters it collects. but this is highly
>as the true source of havege random is not the CPU, but the same irqs
>other hw events. the CPU just acts as a hard to observe prng. so
>i'm not a fan. without looking into it deeper, i believe this is also
>You are correct. The only guarantee that I can make about Enranda, in
>absence of physical entropy, is that it's a hard-to-observe PRNG with a
>state space of O(1M) bits which ignores most periodic timedelta
>Without a security violation of the OS, however, I think it's
>steal enough timedeltas across a process boundary to predict its output
>any useful extent. Cache miss and timing attacks are useless, as is a
>parallel instance of Enranda. If anyone can prove otherwise, it would
>a very interesting read.
>The ideal physical random number generator, I think, would be an analog
>computer of macroscopic size, like something soldered together inside a
>clear case. That's the only way we could verify its functionality. I
>never buy something labelled "random number generator" that comes in a
>black box containing 10 nanometer features or whatever. Who knows how
>would actually work under the hood.
>cryptography mailing list
>cryptography at randombit.net
mgreene at securityinnovation.com
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the cryptography