Abstract
In this paper, we examined the properties of Liu-Xiao clock-controlled generators [7] and two kinds of cascaded clock-controlled generators, namely, Gollmann-Chambers and Liu-Xiao r-cascaded clock-controlled generators. We derived some new results on the period, the linear complexity and the characteristic polynomials of these three clock-controlled generators under certain conditions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
T. Beth and F.C. Piper; The Stop-and-go generator, Advances in Cryptology, EUROCRYPT’84, Lecture Notes in Computer Science, Springer-Verlag, New York, 209 (1985), 88–92.
D. Gollmann, Pseudo random properties of cascade connections of clock controlled shift registers, Advances in Cryptology, EUROCRYPT’84, Lecture Notes in Computer Science, Springer-Verlag, New York, 209 (1985), 93–98.
D. Gollmann, Linear recursions of cascaded sequences, Contributions to General Algebra 3, (1984), 173–179.
D. Gollmann and W.G. Chambers, A cryptanalysis of Stepk k,m -Cascades, Advances in Cryptology, EUROCRYPT’89, Lecture Notes in Computer Science, Springer-Verlag, New York, 434 (1990), 680–687.
C.G. Günther, Alternating step generators controlled by De Bruijn sequences, Advances in Cryptology, EUROCRYPT’87, Lecture Notes in Computer Science, Springer-Verlag, New York, 304 (1988), 5–14.
R. Lidl and H. Niederreiter, “Introduction to finite fields and their applications”, Cambridge University Press, 1986.
X. Liu and G.Z. Xiao, Linear complexity of a type of clock-controlled sequences, Electronic letters 28 No 8 (1992), 709–710.
B. Smeets, A note on sequences generated by clock controlled shift registers, Advances in Cryptology, EUROCRYPT’85, Lecture Notes in Computer Science, Springer-Verlag, New York, 219 (1986), 142–148.
R. Vogel, On the linear complexity of cascaded sequences, Advances in Cryptology, EUROCRYPT’84, Lecture Notes in Computer Science, Springer-Verlag, New York 209 (1985), 99–109.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag London
About this paper
Cite this paper
Tan, C.H. (1999). Period and Linear Complexity of Cascaded Clock-Controlled Generators. In: Ding, C., Helleseth, T., Niederreiter, H. (eds) Sequences and their Applications. Discrete Mathematics and Theoretical Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-0551-0_28
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0551-0_28
Publisher Name: Springer, London
Print ISBN: 978-1-85233-196-2
Online ISBN: 978-1-4471-0551-0
eBook Packages: Springer Book Archive