Cryptanalysis of Linear Feedback Shift Registers (Cryptanalysis of Linear Feedback Shift Registers)

From Algorithm Wiki
Revision as of 14:04, 15 February 2023 by Admin (talk | contribs)
Jump to navigation Jump to search

Description

Find the shortest linear feedback shift register that can generate a given finite sequence of digits.

Parameters

No parameters found.

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

Cryptanalysis of Linear Feedback Shift Registers - Time.png

Space Complexity Graph

Cryptanalysis of Linear Feedback Shift Registers - Space.png

Pareto Frontier Improvements Graph

Cryptanalysis of Linear Feedback Shift Registers - Pareto Frontier.png