Abstract
The shrinking generator is a keystream generator which is good for stream ciphers in wireless mobile communications, because it has simple structure and generates a keystream faster than other generators. Nevertheless, it has a serious disadvantage that its keystream is not balanced if they use primitive polynomials as their feedback polynomials. In this paper, we present a method to construct balanced shrinking generators by modifying the structure of the shrinking generator and analyze their cryptographical properties including period, balancedness, linear complexity, and probability distribution. Experimental results show that the keystreams of these generators have larger linear complexity than that of the shrinking generator, provided that the sizes of LFSRs are fixed.
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
N. Alon, O. Gollreich, J. Hastad, and R. Peralta, “Simple constructions of almost k-wise independent random variables,” 31th Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, pp. 544–553, 1990. 221
S.R. Blackburn, “The linear complexity of the self-shrinking generator,” IEEE Trans. on Inform. Theory, IT-45, no. 6, pp. 2073–2077, September 1999. 218
D. Coppersmith, H. Krawczyk, and Y. Mansour, “The shrinking generator,” Advanced in Cryptology-CRYPTO’93, Lecture Notes in Computer Science, vol. 773, pp. 22–39, 1993. 213, 217, 220, 221, 222
S.W. Golomb, Shift Resister Sequences, Aegean Park Press, 1982. 214, 218
E. Kushilevitx and Y. Mansour, “Learning decision trees using the fourier spectrum,” Proceedings of the 23th Annual ACM Symposium on Theory of Computing, pp. 455–464, May. 1991. 222
W. Meier and O. Staffelbach, “The self-shrinking generator,” Advanced in Cryptology-EUROCRYPT’94, Lecture Notes in Computer Science, vol. 950, pp. 205–214, 1995. 213, 215
A. J. Menezes, P.C. Oorshot, S.A. Vanstone, Handbook of Applied Cryptography, CRC Press, 1997. 213
R.A. Rueppel,Analysis and Design of Stream Ciphers, Springer-Verlag, 1986. 213
I. Shparlinski, “On some properties of the shrinking generator,” Designs, Codes and Cryptography, vol. 23, pp. 147–156, 2001. 215
T. Siegenthaler, “Correlation-immunity of nonlinear combining functions for cryptographic applications,” IEEE Transactions on Information Theory, IT-30, pp. 776–780, Sept. 1984.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ah Choi, S., Yang, K. (2003). Balanced Shrinking Generators. In: Lee, P.J., Lim, C.H. (eds) Information Security and Cryptology — ICISC 2002. ICISC 2002. Lecture Notes in Computer Science, vol 2587. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36552-4_15
Download citation
DOI: https://doi.org/10.1007/3-540-36552-4_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00716-6
Online ISBN: 978-3-540-36552-5
eBook Packages: Springer Book Archive