On Sat, Apr 16, 2005 at 11:10:33AM -0000, [EMAIL PROTECTED] wrote: > Thank you for pointing out the paper; Appendix A is particularly > interesting. And the [BST03] reference looks *really* nice! I haven't > finished it yet, but based on what I've read so far, I'd like to > *strongly* recommnd that any would-be /dev/random hackers read it > carefully. It can be found at > http://www.wisdom.weizmann.ac.il/~tromer/papers/rng.pdf > > Happily, it *appears* to confirm the value of the LFSR-based input > mixing function. Although the suggested construction in section 4.1 is > different, and I haven't seen if the proof can be extended.
Correct me if I'm wrong here, but uniformity of the linear function isn't sufficant even if we implemented like this (right now it's more a+X than a <dot> X). The part which suggests choosing an irreducible poly and a value "a" in the preprocessing stage ... last I checked the value for a and the poly need to be secret. How do you generate poly and a, Catch-22? Perhaps I'm missing something and someone can point it out. JLC - To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to [EMAIL PROTECTED] More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
