Re:Really Fixing Getrandom()
by dooglius on Friday October 18, 2019 @08:22AM
(#21290723)
Well, that's not entirely true, even if two random bits are independent, xor-ing them only gives you one random bit. What actually happens in Linux is that each new input of random bits gets pushed through a cryptographic hash, before being xor'd.
[ Parent
| on HN ]
From replies it seems my two sentences weren't as clear as I thought. I'll try to refine it:
A property of bitwise xoring random variable `x` with a constant (or otherwise non-random but independent) value is that the entropy of `x` is preserved in the result.
Re:Really Fixing Getrandom()
by WAHa_06x36 on Sunday October 20, 2019 @07:24AM
(#21303479)
However, xoring two arbitrary random variables is NOT guaranteed to preserve entropy. Preserving entropy only happens under certain specific conditions.
Under what circumstances would xoring `x` and `y` not produce a result with entropy at least as great as `x`?
Re:Really Fixing Getrandom()
by WAHa_06x36 on Monday October 21, 2019 @07:23AM
(#21310964)
In the very obvious cases where x == y, or x == not y, or x == y + 1, or many other correlations.
Only if y is known to be dependent on x. If y is random but just so happens to be `not x` or `== x` then that won't make the result any less random.
0 is as random a number as 529890873740477 is.
Re:Really Fixing Getrandom()
by WAHa_06x36 on Tuesday October 22, 2019 @11:35AM
(#21324840)
Single numbers don't really have entropy at all, so that is not something it even makes sense to talk about.