Hi,
Sorry to answer this late, but i was pretty busy, and i assume Olivier
Vivolo is on vacation.
For a polynomial, being primitive implies being irreducible, and the
polynomial which must be primitive is Q(x), as you described it
earlier, on GF(2^32).
When the polynomials will be primitive,the T
Hi Linus:
This push fixes a weakness in random number generation of file random.c.
The two polynomials of LFSR used in Linux/drivers/char/random.c are
P1(X) = x^128 + x^104 + x^76 + x^51 +x^25 + x + 1, for input pool
P2(X) = x^32 + x^26 + x^19 + x^14 + x^7 + x + 1 , for output pool
These polynom
