Cryptanalysis of Linear Feedback Shift Registers: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "== Problem Description== == Bounds Chart == 350px == Step Chart == 350px == Improvement Table == {| class="wikitable" style="text-align:center;" width="100%" !width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links |- | rowspan="1" | Exp/Factorial | | |- | rowspan="...")
 
No edit summary
Line 1: Line 1:
== Problem Description==
{{DISPLAYTITLE:Cryptanalysis of Linear Feedback Shift Registers (Cryptanalysis of Linear Feedback Shift Registers)}}
== Description ==  


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


== Bounds Chart ==
== Parameters ==  
[[File:Cryptanalysis_of_Linear_Feedback_Shift_RegistersBoundsChart.png|350px]]


== Step Chart ==
No parameters found.
[[File:Cryptanalysis_of_Linear_Feedback_Shift_RegistersStepChart.png|350px]]
 
== Table of Algorithms ==  
 
{| class="wikitable sortable"  style="text-align:center;" width="100%"
 
! Name !! Year !! Time !! Space !! Approximation Factor !! Model !! Reference


== Improvement Table ==
{| class="wikitable" style="text-align:center;" width="100%"
!width="20%" | Complexity Classes !! width="40%" | Algorithm Paper Links !! width="40%" | Lower Bounds Paper Links
|-
| rowspan="1" | Exp/Factorial
|
|
|-
|-
| rowspan="1" | Polynomial > 3
 
|
| [[Berlekamp–Massey algorithm (Cryptanalysis of Linear Feedback Shift Registers Cryptanalysis of Linear Feedback Shift Registers)|Berlekamp–Massey algorithm]] || 1969 || $O(n^{2})$ || $O(N)$? || Exact || Deterministic || [https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/document/1054260 Time]
|
|-
|-
| rowspan="1" | Cubic
|}
|
 
|
== Time Complexity graph ==
|-
 
| rowspan="1" | Quadratic
[[File:Cryptanalysis of Linear Feedback Shift Registers - Time.png|1000px]]
|
 
|
== Space Complexity graph ==
|-
 
| rowspan="1" | nlogn
[[File:Cryptanalysis of Linear Feedback Shift Registers - Space.png|1000px]]
|
 
|
== Pareto Decades graph ==
|-
 
| rowspan="1" | Linear
[[File:Cryptanalysis of Linear Feedback Shift Registers - Pareto Frontier.png|1000px]]
|
|
|-
| rowspan="1" | logn
|
|
|-|}

Revision as of 10:23, 15 February 2023

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

Error creating thumbnail: Unable to save thumbnail to destination

Space Complexity graph

Error creating thumbnail: Unable to save thumbnail to destination

Pareto Decades graph

Error creating thumbnail: Unable to save thumbnail to destination
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Cryptanalysis_of_Linear_Feedback_Shift_Registers&oldid=44068"