On the Stability of m-Sequences
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 difficult due to its similarity to a well studied problem in coding theory. We also provide results about the relative frequencies of the different 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.
KeywordsBinary Sequence Linear Complexity Brute Force Period Length Cyclic Code
Unable to display preview. Download preview PDF.
- 1.Berbain, C., Billet, O., Canteaut, A., Courtois, N., Debraize, B., Gilbert, H., Goubin, L., Gouget, A., Granboulan, L., Lauradoux, C., Minier, M., Pornin, T., Silbert, H.: DECIMv2. In: eStream Candidate, ECRYPT Stream Cipher Workshop SKEW (2005)Google Scholar
- 2.Dawson, E., Clark, A., Golić, J., Millan, W., Penna, L., Simpson, L.: The LILI-128 Keystream Generator. In: Proc. 1st NESSIE Workshop (2000)Google Scholar
- 5.Ekdahl, P., Johansson, T.: Another Attack on A5/1. IEEE Transactions on Information Theory 49(1) (2003)Google Scholar
- 6.Golomb, S.W.: Shift Register Sequences. Aegean Park Press (1982)Google Scholar
- 7.Hell, M., Johansson, T., Meier, W.: Grain - A Stream Cipher for Constrained Environments. International Journal of Wireless and Mobile Computing, Special Issue on Security of Computer Network and Mobile Systems (2006)Google Scholar
- 8.Hu, H.: Periods on Two Kinds of Nonlinear Feedback Shift Registers with Time Varying Feedback Functions Technical Reports, Center for Applied Cryptographic Research (2011)Google Scholar
- 11.MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland (1978)Google Scholar
- 12.Meidl, W., Aly, H., Winterhof, A.: On the k-error linear complexity of cyclotomic sequences. Journal Mathematical Cryptography (2007)Google Scholar