Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{2})$ == Space Complexity == $O(N)$? words (Computes and stores constant number of polynomials of degree $O(N)$) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1969 == Reference == https://ieeexplore.ieee.org/document/1054260") |
No edit summary |
||
| Line 5: | Line 5: | ||
== Space Complexity == | == Space Complexity == | ||
$O( | $O(n)$? words | ||
(Computes and stores constant number of polynomials of degree $O( | (Computes and stores constant number of polynomials of degree $O(n)$) | ||
== Description == | == Description == | ||
Latest revision as of 07:56, 10 April 2023
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$? words
(Computes and stores constant number of polynomials of degree $O(n)$)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM
Year
1969