Abstract
In this paper, we first determine the number of cycles of a [1, κ] self-decimated m-sequence obtained from an LFSR of length L for κ ≤ L and κ ≥ 2L — L. Next, we derive a lower bound on the period of a [1, k] self-decimated m-sequence for 3 ≤ κ ≤ L. Finally, we present the exact values of the bit pair frequencies of [1, 2] self-decimated m-sequences. We prove that each bit pair occurs with probability almost 1/4.
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
A. V. Aho, “Algorithms for Finding Patterns in String,” Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity, J. van Leeuwen ed., MIT Press, 1990, pp. 255–300.
S. W. Golomb, Shift Register Sequences(revised edition), Aegean Park Press, 1982.
R. A. Rueppel, “When Shift Registers Clock Themselves,” Advances in Cryptology — EUROCRYPT ‘87, Lecture Notes in Computer Science 304, Springer-Verlag, 1988, pp. 53–64.
R. A. Rueppel, “Stream Ciphers,” Contemporary Cryptology: The Science of Information Integrity, G. J. Simmons ed, IEEE Press, 1992, pp. 65–134.
K. Zeng, C.-H. Yang, D.-Y. Wei and T.R.N. Rao, “Pseudorandom Bit Generators in Stream-Cipher Cryptography,” IEEE Computer, v. 24, n. 2, Feb 1991, pp. 8–17.
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
Sato, F., Kurosawa, K. (1999). On the Randomness of a [d, k] Self-Decimation Stream Key Generator. 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_26
Download citation
DOI: https://doi.org/10.1007/978-1-4471-0551-0_26
Publisher Name: Springer, London
Print ISBN: 978-1-85233-196-2
Online ISBN: 978-1-4471-0551-0
eBook Packages: Springer Book Archive