The Number of Output Sequences of a Binary Sequence Generator

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 547)


In this paper, a number of output sequences is proposed as a characteristic of binary sequence generators for cryptographic applications. Sufficient conditions for a variable-memory binary sequence generator to produce maximum possible number of output sequences are derived.


Memory Location Linear Complexity Output Sequence Cyclic Shift Cryptographic Application 
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.

V. References

  1. [1]
    Jovan Dj. Golić, Miodrag M. Mihaljević, “Minimal linear equivalent analysis of a variable-memory binary sequence generator” IEEE Trans. Inform. Theory. vol. IT-36, pp. 190–192, Jan. 1990.Google Scholar
  2. [2]
    S. M. Jennings, “A special class of binary sequences”, Ph.D. thesis. Westfield College, London University, 1980.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.Institute of Applied Mathematics and ElectronicsBelgrade
  2. 2.School of Electrical EngineeringUniversity of BelgradeYugoslavia

Personalised recommendations