Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers)

From Algorithm Wiki
Revision as of 10:53, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Berlekamp–Massey_algorithm_(Cryptanalysis_of_Linear_Feedback_Shift_Registers_Cryptanalysis_of_Linear_Feedback_Shift_Registers)&oldid=44908"