Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight

(tye)Re2: LFSR golf

by tye (Sage)
on May 08, 2001 at 18:57 UTC ( [id://78845] : note . print w/replies, xml ) Need Help??

in reply to Re: (tye)Re: LFSR golf
in thread LFSR golf

Like you mentioned, so-called "pseudorandom" number sequences are also identical for the same initial seed. I felt that "somewhat random" was less strong of a statement than "pseudorandom", but I can see where others would disagree. So I probably should have just stuck with "pseudorandom".

For what it's worth, I find "disordered" and "lacking pattern" worse (the bits have a definite pattern and order). ;)

This reminds me that I forgot to mention that the bit stream from a single LFSR has been studied to the point that a small subseries of bits is enough to predict the entire series. However, two carefully chosen LFSRs where each bit from one is used to determine whether the next bit from the other will be output or thrown away has been analyzed and found to be cryptographically strong.

        - tye (but my friends call me "Tye")