I'm reading through wikipedia about Linear Feedback Shift Registers (Specifically Fibonacci LFSRs) and the only restrictions it mentions about the taps are:
- The LFSR will only be maximum-length if the number of taps is even; just 2 or 4 taps can suffice even for extremely long sequences.
- The set of taps must be relatively prime, and share no common divisor to all taps.
It has two other bullet points basically saying that there can be more than one working set of taps, and if you find one set of taps, you can use that to determine another set of taps. Is this all it takes to find taps?
Are these the only restrictions to finding taps in a Fibonacci LFSR?
I know there are plenty of reference tables to look up taps, but I'm trying to understand the fundamentals of an LFSR better.