* Joerg Arndt <arndt@jjj.de> [Feb 02. 2012 10:15]:
* Marc LeBrun <mlb@well.com> [Feb 02. 2012 07:23]:
[...]
Small correction:
[...]
Use a LFSR (over GF(2)) with some polynomial allowing easy mod operation, e.g., one from http://www.jjj.de/mathdata/all-lowblock-irredpoly-short.txt it should span a few words (I consider period 2^128 (Salmon et. al. paper) a bit small, so go for, say >=4 words to get >=2^256 ).
This should have been http://www.jjj.de/mathdata/lowbit-primpoly.txt # Binary primitive polynomials with lowest-most possible set bits. # These are the minimal numbers with the corresponding # polynomial of given degree primitive. E.g.g the entry 256,10,5,2,0 says that x^256+x^10+x^5+x^2+1 is primitive over GF(2) (and is the lex-first such polynomial).
[...]