Use this URL to cite or link to this record in EThOS:
Title: Algorithms for the k-error linear complexity of cryptographic sequences over finite fields
Author: Alecu, Alexandra
ISNI:       0000 0004 2675 8661
Awarding Body: Loughborough University
Current Institution: Loughborough University
Date of Award: 2008
Availability of Full Text:
Access from EThOS:
Access from Institution:
Some cryptographical applications use pseudorandom sequences and require that the sequences are secure in the sense that they cannot be recovered by only knowing a small amount of consecutive terms. The security of the sequences is translated into several measurable characteristics. For example they should have a large linear complexity and also a large k-error linear complexity. This thesis focuses on the k-error linear complexity of sequences. Currently, efficient algorithms for computing the k-error linear complexity of a sequence only exist for special classes of sequences, e.g. of period equal to a power of the characteristic of the field. It is therefore useful to find a general and efficient algorithm to compute a good approximation of the k-error linear complexity.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available