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/9479

Title: On the stability of m-sequences
Authors: Salagean, A.M.
Burrage, Alex J.
Phan, Raphael C.-W.
Issue Date: 2011
Publisher: Springer
Citation: SALAGEAN, A.M., BURRAGE, A.J. and PHAN, R.C.-W., 2011. On the stability of m-sequences. IN: 13th International IMA conference on Cryptography and Coding, Oxford, 12-15th Dec., 7089 pp. 259 - 274
Series/Report no.: Lecture Notes in Computer Science;7089
Abstract: We study the stability of m-sequences in the sense of determining the number of errors needed for decreasing the period of the sequences, as well as giving lower bounds on the k-error linear complexity of the sequences. For prime periods the results are straightforward so we concentrate on composite periods. We give exact results for the case when the period is reduced by a factor which is a Mersenne number and for the case when it is reduced by a prime p such that the order of 2 modulo p equals p 􀀀 1. The general case is believed to be di cult due to its similarity to a well studied problem in coding theory. We also provide results about the relative frequencies of the di erent cases. We formulate a conjecture regarding the minimum number of errors needed for reducing the period at all. Finally we apply our results to the LFSR components of several well known stream ciphers.
Description: The original publication is available at www.springerlink.com
Version: Accepted for publication
DOI: 10.1007/978-3-642-25516-8
URI: https://dspace.lboro.ac.uk/2134/9479
Publisher Link: http://www.springerlink.com/content/x0427w826655/#section=1000205&page=1
Appears in Collections:Conference Papers and Presentations (Computer Science)

Files associated with this item:

File Description SizeFormat
burrage.pdf362.69 kBAdobe PDFView/Open


SFX Query

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