Re:When Random Isn't Random Enough: Lessons from an Online P...
by tptacek on Tuesday February 11, 2014 @12:35AM
(#7215989)
I was reacting to "blocking function bound by available entropy".
[ Parent
| on HN ]
Re:When Random Isn't Random Enough: Lessons from an Online P...
by hueving on Tuesday February 11, 2014 @09:18PM
(#7222087)
If you care about having good random bytes, you should call a blocking random function (i.e it doesn't return random data until enough entropy is collected)(e.g./dev/urandom).
If you don't care about security, you can certainly call one that always returns using a PRNG (/dev/random). However, with it being based on a much smaller random seed, using it to generate keys is massively reducing the key space an attacker would need to search for discovery.
In summary, reading from /dev/random is a blocking function bound by available entropy and it's more secure than it's /dev/urandom counterpart that is not bound by entropy.
I'm not sure what your problem is there. Care to elaborate?