Abstract
A method for analyzing the linear complexity of nonlinear filterings of PN-sequences that is based on the Discrete Fourier Transform is presented. The method makes use of “Blahut’s theorem”, which relates the linear complexity of an N-periodic sequence in GF(q)N and the Hamming weight of its frequency-domain associate. To illustrate the power of this approach, simple proofs are given of Key’s bound on linear complexity and of a generalization of a condition of Groth and Key for which equality holds in this bound.
This work was done while the author was on leave from CEPESC, Cx Postal 02976, Brasília, DF, BRASIL, CEP 70610-200
Chapter PDF
Similar content being viewed by others
Keywords
- Discrete Fourier Transform
- Linear Complexity
- Stream Cipher
- Primitive Element
- Inverse Discrete Fourier Transform
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
R. E. Blahut, Theory and Practice of Error Control Codes, Addison-Wesley Publishing Company, 1983.
E. J. Groth “Generation of binary sequences with controllable complexity,” IEEE Trans. Inform. Theory, vol. IT-17, no. 3, pp. 288–296, May 1971.
E. L. Key “An analysis of the structure and complexity of nonlinear binary sequence generators,” IEEE Trans. Inform. Theory, vol. IT-22, no. 6, pp. 732–736, Nov. 1976.
R. Lidl and H. Niederreiter, Introduction to Finite Fields and their Applications, Cambridge: Cambridge Univ. Press, 1986.
J. L. Massey, “Shift-register synthesis and BCH decoding,” IEEE Trans. Inform. Theory, vol. IT-15, pp. 122–127, Jan. 1969.
J. L. Massey, “Review of R. E. Blahut, Theory and Practice of Error Control Codes”, IEEE Trans. Inform. Theory, vol. IT-31, no. 4, p. 553, Jul. 1985.
R. A. Rueppel, Analysis and Design of Stream Ciphers, Berlin: Springer-Verlag, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Massey, J.L., Serconek, S. (1994). A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences. In: Desmedt, Y.G. (eds) Advances in Cryptology — CRYPTO ’94. CRYPTO 1994. Lecture Notes in Computer Science, vol 839. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48658-5_31
Download citation
DOI: https://doi.org/10.1007/3-540-48658-5_31
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58333-2
Online ISBN: 978-3-540-48658-9
eBook Packages: Springer Book Archive