Abstract
A new class of sequences, which we term [d,k] self-decimated sequences, is investigated. For appropriate choices of [d,k] these sequences possess large periods, balanced k-distributions, large linear complexities, and moderate out-of-phase autocorrelation magnitudes. Furthermore, they are easy to generate. These properties suggest that [d,k] self-decimated sequences may have some applications in cryptography and spread spectrum communication.
Chapter PDF
Similar content being viewed by others
Keywords
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.
5 References
N. Zierler, “Linear recurring sequences”, J. Soc.. Indust. Appl. Math., Vol. 7, 1959.
D.V. Sarwate, M.B. Pursley, “Crosscorrelation properties of pseudorandom and related Sequences”, Proc. of the IEEE, Vol. 68, May 1980.
J.L. Massey, R.A. Rueppel, “Linear ciphers and random sequence generators with multiple clocks”, Proc. of Eurocrypt 84, Paris, Lecture Notes in Computer Science, Vol. 209, Springer-Verlag.
R.A. Rueppel, “Analysis and design of stream ciphers”, Springer-Verlag, 1986.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rueppel, R.A. (1988). When Shift Registers Clock Themselves. In: Chaum, D., Price, W.L. (eds) Advances in Cryptology — EUROCRYPT’ 87. EUROCRYPT 1987. Lecture Notes in Computer Science, vol 304. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39118-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-39118-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19102-5
Online ISBN: 978-3-540-39118-0
eBook Packages: Springer Book Archive