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

Warning The system is temporarily closed to updates for reporting purpose.

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

[thumbnail of akinihsanh.pdf] PDF
akinihsanh.pdf

Download (429kB)

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
Divisions: Faculty of Engineering and Natural Sciences > Basic Sciences > Mathematics
Faculty of Engineering and Natural Sciences
Depositing User: IC-Cataloging
Date Deposited: 18 Apr 2008 10:17
Last Modified: 26 Apr 2022 09:41
URI: https://research.sabanciuniv.edu/id/eprint/8149

Actions (login required)

View Item
View Item