看板 FB_security 關於我們 聯絡資訊
On Wed, 03 Oct 2012 13:42:03 +0200 Dag-Erling Sm=F8rgrav wrote: > RW <rwmaillists@googlemail.com> writes: > > As I pointed-out before if you use binuptime() you cant use entropy > > estimation based on bit-shifting time differences. >=20 > Forgot to answer this: yes you can. The last time I raised the > issue, I also provided sample code for reimplementing > get_cyclecount() in terms of binuptime(). Basically, you discard the > top N bits of the integer portion and the bottom 64 - N bits of the > fractional portion, and you're left with a monotonically increasing > 64-bit value that will wrap around at a point that depends on N. >=20 Yes, getting a monotonically increasing value from binuptime() is simple, but the xor issue is secondary to the problem I was referring to when I quoted the arm code for get_cyclecount(). When the time difference comes from the TSC, Pavels code computes an amount of entropy that scales reasonably well with TSC frequency. When when you use binuptime() you've thrown away all counter frequency information. The entropy calculation will produce a completely bogus figure. _______________________________________________ freebsd-security@freebsd.org mailing list http://lists.freebsd.org/mailman/listinfo/freebsd-security To unsubscribe, send any mail to "freebsd-security-unsubscribe@freebsd.org"