Summary
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.
This work was supported in part by the National Swedish Board for Technical Development under grants 81-3323 and 83-4364 at the University of Lund.
Chapter PDF
Similar content being viewed by others
Keywords
- 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.
References
J.L. Massey, “Shift-Register Synthesis and BCH Decoding”, IEEE Trans. on Inf. Th., IT-15, Jan. 1969, pp. 122–127.
P. Nyffeler, “Binäre Automaten und ihre Linearen Rekursionen,” Ph.D dissertation, University of Bern, Switzerland, 1975.
R. Lidl and H. Niederreiter, “Encyclopedia of Mathematics and its Applications, Finite Fields, Vol.20, Addison-Wesley Publishing Company, Reading, Mass., 1983.
T. Beth and F.C. Piper, “The stop-and-go generator”, Proceedings of EUROCRYPT 84 (Paris, 1984), to appear.
W.G. Chambers and S.M. Jennings, “Linear Equivalence of Certain BRM Shift-Register Sequences,” Electr. Letters, Vol. 20, Nov. 1984, pp. 1018–1019.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Smeets, B. (1986). A Note on Sequences Generated by Clock Controlled Shift Registers. In: Pichler, F. (eds) Advances in Cryptology — EUROCRYPT’ 85. EUROCRYPT 1985. Lecture Notes in Computer Science, vol 219. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39805-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-39805-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16468-5
Online ISBN: 978-3-540-39805-9
eBook Packages: Springer Book Archive