title   
  

On the linear complexity and linear complexity profile of sequences in finite fields

Akın, İhsan Haluk (2002) On the linear complexity and linear complexity profile of sequences in finite fields. [Thesis]

[img]PDF - Registered users only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
419Kb

Official URL: http://risc01.sabanciuniv.edu/record=b1064373 (Table of Contents)

Abstract

Pseudo random sequences, that are used for stream ciphers, are required to havetheproperties of unpredictability and randomness. An important tool for measuringthese features is the linear complexity profile of the sequence in use.In this thesis we present a survey of some recent results obtained on linearcomplexity and linear complexity profile of pseudo random sequences. The relationbetween the polynomial degree and the linear complexity of a function over a finite field is given, bounds for linear complexity of the "power generator" and "the selfshrinking generator" are presented and a new method of construction of sequences of high linear complexity profile is illustrated.

Item Type:Thesis
Uncontrolled Keywords:Linear recurrence sequences, linear complexity, linear complexity profile
Subjects:Q Science > QA Mathematics
ID Code:8149
Deposited By:IC-Cataloging
Deposited On:18 Apr 2008 10:17
Last Modified:26 Dec 2008 14:46

Repository Staff Only: item control page