TRC> There is no reason in modern cryptography to read more than one byte
TRC> from /dev/random ever in a single application; once you have done
TRC> that, or confirmed some other way that the the entropy pool is seeded,
TRC> you should generate keys from /dev/urandom.

DAH> There should be some way to do that without throwing away 8 random
DAH> bits.
Isn't that called poll()/select() etc?
As far as I understand, it's not about actually reading from /dev/random, 
but checking whether you could read without blocking, isn't it?

Reply via email to