On Mon, Oct 06, 2008 at 03:01:01PM -0700, Kees Cook wrote:Sure in a perfect world we had endless money and endless entropy and no world hunger and could make all such RNGs truly random. But in practice the world is not like that. And entropy on a standard Linux system is a very precious commodity. And you won't deny that session keys are more important than mmap placement, will you? It's eating entropy on every process start, so it's a incredible drain on the entropy pool. Just calculate how much entropy a standard "configure" run or kernel build will need. Your current implementation is high cost. IMHO it needs a new class of random numbers in the kernel that use some cryptographically strong RNG (there are a couple of candidates like yarrow) which is very rarely seeded from the entropy pool[1] and use that for these applications. A couple of other users in the kernel would benefit that too, most users of get_random_bytes() probably should be reviewed for their true requirements. Ideally expose it to userland too so that dumb users like tmpfile can use it too. An alternative would be also to use existing entropy sources like the TPMs which are in many boxes now better and automatically, but that doesn't help on systems without TPM. -Andi [1] getting that right is tricky, note that the entropy pool is useless early at boot because there's no random input. -- ak@linux.intel.com --
| Ingo Molnar | [patch 12/13] syslets: x86: optimized copy_uatom() |
| Greg Kroah-Hartman | [PATCH 017/196] aoechr: Convert from class_device to device |
| Yinghai Lu | Re: 2.6.26, PAT and AMD family 6 |
| Jan Engelhardt | intel iommu (Re: -mm merge plans for 2.6.23) |
git: | |
| Gerrit Renker | [PATCH 27/37] dccp: Integration of dynamic feature activation - part 2 (server side) |
| David Miller | [GIT]: Networking |
| David Miller | Re: [PATCH] pkt_sched: Destroy gen estimators under rtnl_lock(). |
| Natalie Protasevich | [BUG] New Kernel Bugs |
