[lkml]   [2017]   [Aug]   [16]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
Messages in this thread
SubjectRe: random.c: LFSR polynomials are not irreducible/primitive
Am Dienstag, 15. August 2017, 17:12:24 CEST schrieb Theodore Ts'o:

Hi Theodore,

> Stephan, if you have any comments on the proposal made by David
> Fontaine and Olivier Vivolo, I'd appreciate hearing them!

I think I have some news: The magma code I used for GF(2^32) testing was not

The corrected magma code is attached (thanks to Dr. Peter Birkner, BSI, who
helped me here).

That magma code shows:

- the current polynomials for Q(X) = α**3 (P(X) − 1) + 1 are irreducible but
not primitive over GF(2^32)

- the polynomials suggested in Q(X) =
α**4 (P(X) − 1) + 1 are both, irreducible and primitive over GF(2^32)

The use of GF(2^32) is important, because we apply the LFSR to a 32 bit word.
Hence, we have 2^32 permutations the LFSR should evenly cover.

Bottom line, I would recommend that random.c is patched to take the
polynomials suggested in

If it is of any help, the attached magma code could be preserved somewhere
useful (in random.c?)

Stephan[unhandled content-type:application/x-wine-extension-mag]
 \ /
  Last update: 2017-08-16 14:53    [W:0.045 / U:0.196 seconds]
©2003-2020 Jasper Spaans|hosted at Digital Ocean and TransIP|Read the blog|Advertise on this site