Hide/Show Apps

On the expected value of the linear complexity of periodic sequences

Özakın, Çiğdem
In cryptography, periodic sequences with terms in F2 are used almost everywhere. These sequences should have large linear complexity to be cryptographically strong. In fact, the linear complexity of a sequence should be close to its period. In this thesis, we study the expected value for N-periodic sequences with terms in the finite field Fq. This study is entirely devoted to W. Meidl and Harald Niederreiter̕s paper which is أOn the Expected Value of the Linear Complexity and the k-Error Linear Complexity of Periodic Sequencesؤ We only expand this paper, there is no improvement. In this paper there are important theorems and results about the expected value of linear complexity of periodic sequences.