Cryptanalysis of Linear Feedback Shift Registers: Difference between revisions
Jump to navigation
Jump to search
No edit summary |
No edit summary |
||
| Line 23: | Line 23: | ||
[[File:Cryptanalysis of Linear Feedback Shift Registers - Time.png|1000px]] | [[File:Cryptanalysis of Linear Feedback Shift Registers - Time.png|1000px]] | ||
Latest revision as of 09:10, 28 April 2023
Description
Find the shortest linear feedback shift register that can generate a given finite sequence of digits.
Parameters
$n$: size of input stream
Table of Algorithms
| Name | Year | Time | Space | Approximation Factor | Model | Reference |
|---|---|---|---|---|---|---|
| Berlekamp–Massey algorithm | 1969 | $O(n^{2})$ | $O(n)$? | Exact | Deterministic | Time |
Time Complexity Graph
