Use this URL to cite or link to this record in EThOS:
Title: Complexity measures for classes of sequences and cryptographic applications
Author: Burrage, Alex J.
ISNI:       0000 0004 2734 6175
Awarding Body: Loughborough University
Current Institution: Loughborough University
Date of Award: 2013
Availability of Full Text:
Access from EThOS:
Access from Institution:
Pseudo-random sequences are a crucial component of cryptography, particularly in stream cipher design. In this thesis we will investigate several measures of randomness for certain classes of finitely generated sequences. We will present a heuristic algorithm for calculating the k-error linear complexity of a general sequence, of either finite or infinite length, and results on the closeness of the approximation generated. We will present an linear time algorithm for determining the linear complexity of a sequence whose characteristic polynomial is a power of an irreducible element, again presenting variations for both finite and infinite sequences. This algorithm allows the linear complexity of such sequences to be determined faster than was previously possible. Finally we investigate the stability of m-sequences, in terms of both k-error linear complexity and k-error period. We show that such sequences are inherently stable, but show that some are more stable than others.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Sequences ; Cryptography ; Randomness ; Complexity