Loughborough University
Leicestershire, UK
LE11 3TU
+44 (0)1509 263171
Loughborough University

Loughborough University Institutional Repository

Please use this identifier to cite or link to this item: https://dspace.lboro.ac.uk/2134/12396

Title: Computing the linear complexity for sequences with characteristic polynomial f^v
Authors: Salagean, A.M.
Burrage, Alex J.
Phan, Raphael C.-W.
Keywords: Linear complexity
Games–Chan algorithm
Linear recurrent sequences
Issue Date: 2013
Publisher: © Springer
Citation: SALAGEAN, A.M., BURRAGE, A.J. and PHAN, R.C.-W., 2013. Computing the linear complexity for sequences with characteristic polynomial f^v. Cryptography and Communications, 5 (2), pp. 163 - 177.
Abstract: We present several generalisations of the Games–Chan algorithm. For a fixed monic irreducible polynomial f we consider the sequences s that have as a characteristic polynomial a power of f. We propose an algorithm for computing the linear complexity of s given a full (not necessarily minimal) period of s. We give versions of the algorithm for fields of characteristic 2 and for arbitrary finite characteristic p, the latter generalising an algorithm of Ding et al. We also propose an algorithm which computes the linear complexity given only a finite portion of s (of length greater than or equal to the linear complexity), generalising an algorithm of Meidl. All our algorithms have linear computational complexity. The proposed algorithms can be further generalised to sequences for which it is known a priori that the irreducible factors of the minimal polynomial belong to a given small set of polynomials.
Description: This article was published in the journal, Cryptography and Communications [© Springer] and the definitive version is available at: http://dx.doi.org/10.1007/s12095-013-0080-3
Version: Accepted for publication
DOI: 10.1007/s12095-013-0080-3
URI: https://dspace.lboro.ac.uk/2134/12396
Publisher Link: http://dx.doi.org/10.1007/s12095-013-0080-3
ISSN: 1936-2447
Appears in Collections:Published Articles (Computer Science)

Files associated with this item:

File Description SizeFormat
f^v-journal-accepted-20130104.pdfAccepted version243.97 kBAdobe PDFView/Open


SFX Query

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.