Abstract
Several kinds of stream ciphers—complementary sequences of period sequences, partial sum of period sequences, inverse order sequences and finitely generated sequences, are studied by using techniques of generating functions. Their minimal polynomials, periods, as well as generating functions are given. As to finitely generated sequences, the change of their linear complexity profiles as well as the relationship between the two generated sequences under the case in which the degree of connected polynomials are fixed, are discussed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
H. J. Beker, F. C. Piper, Cipher System—The Protection of Communications, Northwood Books, London, 1982.
R. Lidl, H. Niedereiter, Finite Fields, Addison-Wesley, 1983. Chapter 8.
C. Ronse, Feedback Shift Registers, Springer-Verlay, 1984.
R. A. Rueppel, Analysis and Design of Stream Ciphers, Springer-Verlay, 1986.
T. Siegenthaler, Methoden Fur den Entwurf Von Stream Cipher systemen, Ph. D. thesis, Zurlch, 1986.
Wu. Chuankun, An attack on clock controlled generator sequences,Journal of China Institute of Communications,11 (1990)6, 46–49.
E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, New York, 1968.
J. L. Massey, Shift-register synthesis and BCH decoding,IEEE Trans. on IT,IT-15(1969)1, 122–127.
Author information
Authors and Affiliations
About this article
Cite this article
Chuankun, W. Study on stream ciphers using generating functions. J. of Electron.(China) 10, 34–40 (1993). https://doi.org/10.1007/BF02778759
Issue Date:
DOI: https://doi.org/10.1007/BF02778759