If this is your first visit, be sure to
check out the FAQ by clicking the
link above. You may have to register
before you can post: click the register link above to proceed. To start viewing messages,
select the forum that you want to visit from the selection below.

New "Jitter Entropy" RNG Proposed For Linux

Phoronix: New "Jitter Entropy" RNG Proposed For Linux

The Linux kernel RNG implementation for providing random numbers has worked quite well for its years in use. However, a new jitter entropy generator implementation has been proposed that is capable of providing 100 kB/s throughput of randomness...

For someone less technically inclined. What does this mean? What is entropy in this context and how does it differ from what a PRNG does? How does the proposed solution fix/handle that? Isn't what is being proposed here a PRNG, just a different one?

Entropy is something that is unpredictable, hard to guess.
PRNGs are algorithms that need to be seeded (keyed) with some entropy before they can output anything. Simple example of PRNG: http://en.wikipedia.org/wiki/RC4
(T)RNGs get entropy from physical properties, like thermal noise, nuclear decay or in this case CPU timing jitter.
(T)RNG is usually used to seed PRNG.
Both types output statistical random data.

Entropy is something that is unpredictable, hard to guess.
PRNGs are algorithms that need to be seeded (keyed) with some entropy before they can output anything. Simple example of PRNG: http://en.wikipedia.org/wiki/RC4
(T)RNGs get entropy from physical properties, like thermal noise, nuclear decay or in this case CPU timing jitter.
(T)RNG is usually used to seed PRNG.
Both types output statistical random data.

I was under the impression that true random number generators couldn't be implemented in software due to computers being 100% deterministic, was I wrong?