Update for 15-12-21 14:15
This commit is contained in:
parent
f4943f65a3
commit
7fe58fc451
@ -4,7 +4,7 @@ A LFSR is set of rules to alter a set of bits. They are useful to psudeo random
|
|||||||
number generators, and as key generators for stream ciphers.
|
number generators, and as key generators for stream ciphers.
|
||||||
|
|
||||||
All LFSRs are cyclical in nature, and after a set amount of time will repeat
|
All LFSRs are cyclical in nature, and after a set amount of time will repeat
|
||||||
back into themselves. THe initial state of the bits in the LFSR is called the
|
back into themselves. The initial state of the bits in the LFSR is called the
|
||||||
seed.
|
seed.
|
||||||
|
|
||||||
The maximum period for a _n_ bit shift register is
|
The maximum period for a _n_ bit shift register is
|
||||||
@ -12,3 +12,4 @@ The maximum period for a _n_ bit shift register is
|
|||||||
2^n - 1
|
2^n - 1
|
||||||
|
|
||||||
A *tap* is where a bit is read and fed back into itself.
|
A *tap* is where a bit is read and fed back into itself.
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user