Loughborough University
Browse
Thesis-2008-Alecu.pdf (5.05 MB)

Algorithms for the k-error linear complexity of cryptographic sequences over finite fields

Download (5.05 MB)
thesis
posted on 2018-11-21, 11:05 authored by Alexandra Alecu
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. [Continues.]

History

School

  • Science

Department

  • Computer Science

Publisher

© Alexandra Alecu

Publisher statement

This work is made available according to the conditions of the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) licence. Full details of this licence are available at: https://creativecommons.org/licenses/by-nc-nd/4.0/

Publication date

2008

Notes

A Doctoral Thesis. Submitted in partial fulfilment of the requirements for the award of the degree of Doctor of Philosophy at Loughborough University.

Language

  • en

Usage metrics

    Computer Science Theses

    Exports

    RefWorks
    BibTeX
    Ref. manager
    Endnote
    DataCite
    NLM
    DC