Update for 15-12-21 14:00
This commit is contained in:
parent
b59378f706
commit
f4943f65a3
14
tech/LFSR.wiki
Normal file
14
tech/LFSR.wiki
Normal file
@ -0,0 +1,14 @@
|
|||||||
|
= Linear Feedback Shift Register =
|
||||||
|
|
||||||
|
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.
|
||||||
|
|
||||||
|
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
|
||||||
|
seed.
|
||||||
|
|
||||||
|
The maximum period for a _n_ bit shift register is
|
||||||
|
|
||||||
|
2^n - 1
|
||||||
|
|
||||||
|
A *tap* is where a bit is read and fed back into itself.
|
@ -11,6 +11,10 @@ Hiding information
|
|||||||
* [[substitution|Substitution]]
|
* [[substitution|Substitution]]
|
||||||
* [[Affine]]
|
* [[Affine]]
|
||||||
|
|
||||||
|
=== Misc ===
|
||||||
|
|
||||||
|
* [[LFSR|Linear Feedback Shift Registers]]
|
||||||
|
|
||||||
=== Math for Crypto ===
|
=== Math for Crypto ===
|
||||||
|
|
||||||
* [[../math/congruences]]
|
* [[../math/congruences]]
|
||||||
|
Loading…
Reference in New Issue
Block a user