Abstract
The linear complexity of an N-periodic sequence with components in a field of characteristic p, where N = np ν and gcd(n, p) = 1, is characterized in terms of the n th roots of unity and their multiplicities as zeroes of the polynomial whose cofficients are the first N digits of the sequence. Hasse derivatives are then introduced to quantify these multiplicities and to define a new generalized discrete Fourier transform that can be applied to sequences of arbitrary length N with components in a field of characteristic p, regardless of whether or not gcd(N, p) = 1. This generalized discrete Fourier transform is used to give a simple proof of the validity of the well-known Games-Chan algorithm for finding the linear complexity of an N-periodic binary sequence with N = 2ν and to generalize this algorithm to apply to N-periodic sequences with components in a finite field of characteristic p when N = p ν. It is also shown how to use this new transform to study the linear complexity of Hadamard (i.e., component-wise) products of sequences.
This work was done while the author was on leave at the ETH Zürich from CEPESC, Cx Postal 02976. Brasilia, DF, BRASIL, CEP 70610-200.
Chapter PDF
Similar content being viewed by others
Keywords
References
E. R. Berlekamp, Algebraic Coding Theory. New York: McGraw-Hill, 1968.
S. R. Blackburn, “A Generalisation of the Discrete Fourier Transform: Determining the Minimal Polynomial of a Periodic Sequence,” IEEE Trans. Inform. Theory, vol. IT-40, pp. 1702–1704, Nov. 1994.
G. Castagnoli, J. L. Massey, P. A. Schoeller, and N. Seemann, “On Repeated-Root Cyclic Codes”, IEEE Trans. Inform. Theory, vol. IT-37, pp. 337–342, March 1991.
R. A. Games and A. H. Chan, “A Fast Algorithm for Determining the Complexity of a Binary Sequence with Period 2n,” IEEE Trans. Inform. Theory, vol. IT-29, pp. 144–146, Jan. 1983.
C. G. Günther, “A Finite Field Fourier Transform for Vectors of Arbitrary Length,” pp. 141–153 in Communications and Cryptography: Two Sides of One Tapestry (Eds. R. E. Blahut, D. J. Costello, Jr., U. Maurer and T. Mittelholzer). Norwell, MA, and Dordrecht, NL: Kluver Academic, 1994.
R. Göttfert and H. Niederreiter, “Hasse-Teichmüller Derivatives and Products of Linear Recurring Sequences,” Comtemporary Mathematics, vol. 168, pp.117–125, 1994.
H. Hasse, “Theorie der höheren Differentiale in einem algebraischen Funktionenkörper mit vollkommenen Konstantenkörper bei beliebiger Charakteristik,” J. Reine u. Ang. Math., vol. 175, pp. 50–54, 1936.
E. L. Key, “An analysis of the Structure and Complexity of Nonlinear Binary Sequence Generators,” IEEE Trans. Inform. Th., vol. IT-22, pp. 732–736, Nov. 1976.
R. Lidl and H. Niederreiter, Finite Fields, Encyclopedia of Mathematics and its Applications, vol. 20. Englewood Cliffs, NJ: Addison-Wesley, 1983.
M. E. Lucas, “Sur les congruences des nombres euleriennes et des coefficients difféntiels des functions trigonométriques, suivant un-module premier,” Bull. Soc. Math. France, vol. 6, pp. 49–54, 1878.
J. L. Massey and S. Serconek, “A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences,” Advances in Cryptology-CRYPTO’ 94 (Ed. Y. G. Desmedt), Lecture Notes in Computer Science No. 839. New York: Springer, pp.322–340, 1994.
P. Mathys, “A Generalization of the Discrete Fourier Transform in Finite Fields,” Proc. IEEE Symp. Inform. Theory, San Diego (CA), pp. 14–19, 1990.
K. Paterson, “On the Linear Complexity of Nonlinearly Filtered m-sequences,” preliminary manuscript, Feb. 2, 1996.
M. Robshaw, “On Evaluating the Linear Complexity of a Sequence of Least Period 2n,” Designs, Codes and Cryptography, vol. 4, pp. 263–269, 1994.
R. A. Rueppel, Analysis and Design of Stream Ciphers. Heidelberg and New York: Springer, 1986.
O. Teichmüller, “Differentialrechnung bei Charackteristik p,” J. Reine u. Ang. Math., vol. 175, pp. 89–99, 1936.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Massey, J.L., Serconek, S. (1996). Linear Complexity of Periodic Sequences: A General Theory. In: Koblitz, N. (eds) Advances in Cryptology — CRYPTO ’96. CRYPTO 1996. Lecture Notes in Computer Science, vol 1109. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-68697-5_27
Download citation
DOI: https://doi.org/10.1007/3-540-68697-5_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61512-5
Online ISBN: 978-3-540-68697-2
eBook Packages: Springer Book Archive