A Note on Sequences Generated by Clock Controlled Shift Registers

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


In this paper the linear feedback shift registers are determined that can generate the output sequence of two types of clock controlled shift registers suggested by P. Nyffeler. For one type of clock control sufficient conditions are given which guarantee that maximum linear complexity is obtained. Furthermore, it is shown that the randomness properties for sequences of maximal linear complexity depend on clocking procedure.


Linear Complexity Minimal Polynomial Output Sequence Pseudo Random Sequence Linear Feedback Shift Register 
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.


  1. [1]
    J.L. Massey, “Shift-Register Synthesis and BCH Decoding”, IEEE Trans. on Inf. Th., IT-15, Jan. 1969, pp. 122–127.CrossRefMathSciNetGoogle Scholar
  2. [2]
    P. Nyffeler, “Binäre Automaten und ihre Linearen Rekursionen,” Ph.D dissertation, University of Bern, Switzerland, 1975.Google Scholar
  3. [3]
    R. Lidl and H. Niederreiter, “Encyclopedia of Mathematics and its Applications, Finite Fields, Vol.20, Addison-Wesley Publishing Company, Reading, Mass., 1983.Google Scholar
  4. [4]
    T. Beth and F.C. Piper, “The stop-and-go generator”, Proceedings of EUROCRYPT 84 (Paris, 1984), to appear.Google Scholar
  5. [5]
    W.G. Chambers and S.M. Jennings, “Linear Equivalence of Certain BRM Shift-Register Sequences,” Electr. Letters, Vol. 20, Nov. 1984, pp. 1018–1019.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  1. 1.Department of Computer EngineeringUniversity of LundLundSweden

Personalised recommendations