Tagged Questions
2
votes
2answers
158 views
Berlekamp-Massey algorithm: case when sequence length is less than double the length of the LFSR
Suppose that we have a sequence of $N$ digits which is produced by a Linear Feedback Shift Register (LFSR) and the shortest such LFSR is of length $L$. A very important tool in cryptanalysis of stream ...
2
votes
2answers
418 views
Cryptanalysis of Linear Feedback Shift Registers
It is well known that simple m-sequence linear feedback shift registers have a linear algebraic structure and therefore the generator seed can easily be deduced using the Berlekamp-Massey algorithm. ...
