Update for 06-04-22 11:45
This commit is contained in:
parent
42c761ab8a
commit
56187827b4
@ -7,7 +7,7 @@ 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
|
||||
The maximum period for a _n_ bit shift register is
|
||||
|
||||
2^n - 1
|
||||
|
||||
|
@ -42,7 +42,7 @@ Hiding information
|
||||
|
||||
=== Math for Crypto ===
|
||||
|
||||
* [[../math/congruences|Congruneces]]
|
||||
* [[congruences|Congruneces]]
|
||||
* [[modular_exponentiation|Modular Exponentiation]]
|
||||
|
||||
-------------------
|
||||
|
@ -30,7 +30,7 @@ We make some assumptions
|
||||
* word divisions are not preserved
|
||||
* use frequency analysis to guess high frequency letters
|
||||
- E E N O R I A S are 70% of letters in english
|
||||
* identify
|
||||
* identify
|
||||
- vowels
|
||||
- diagraphs (common combos of letters ie TH)
|
||||
* Use cribs
|
||||
|
Loading…
Reference in New Issue
Block a user