Messages in this thread | | | From | Michael Ellerman <> | Subject | Re: early x86 unseeded randomness | Date | Tue, 15 Aug 2017 22:48:42 +1000 |
| |
Ingo Molnar <mingo@kernel.org> writes:
> * Willy Tarreau <w@1wt.eu> wrote: > >> Nowadays we could use similar methods using RDTSC providing more accurate >> counting. This doesn't provide a lot of entropy of course, given that a >> 2 GHz machine will at most count 31 bits there. But I tend to think that >> what matters during early boot is to transform something highly predictable >> into something unlikely to be predicted (ie: an exploit having to scan 2^31 >> possible addresses will not be really usable). It's also possible to do the >> same with the PIT0 counter ticking at 18.2 Hz without any correlation with >> the RTC by the way, and roughly provide 25 more bits. And if you expect >> that the BIOS has emitted a 800 Hz beep at boot, you could still have a >> divider of 1491 in PIT2 providing 10 more bits, though with a bit of >> correlation with PIT0 since they use the same 1.19 MHz source. These >> methods increase the boot time by up to one second though, but my point >> here is that when you have nothing it's always a bit better. > > One other thing besides trying to extract entropy via timing would be to utilize > more of the machine's environment in seeding the random number generator. > > For example on x86 the E820 table is available very early on and its addresses > could be mixed into the random pool. An external attacker often would not know the > precise hardware configuration. > > Likewise the boot parameters string could be mixed into the initial random pool as > well - and this way distributions could create per installation seed simply by > appending a random number to the boot string.
In fact that could be a per-boot seed, if you just re-ran update-grub in the shutdown scripts with a new value.
cheers
| |