Abstract
The shrinking generator is a very popular sequence generator with cryptographic applications. Nowadays, it is still considered as a secure keystream generator. In this work, it is shown that the knowledge of only a low number of generated bits is sufficient to break it. Indeed, whereas the linear complexity of the generated sequence (the shrunken sequence) is bounded by A ·2(S − 2) < LC ≤ A ·2(S − 1) (A and S being the lengths of the two component registers), we claim that the generator can be cryptanalyzed with the knowledge of A ·S intercepted bits and simple computations. Such a result is proven thanks to the definition of the shrunken sequences as a particular kind of interleaved sequences. A similar attack can be extended to any other generator of the class of clock-controlled shrinking generators. Furthermore, this paper confirms that certain bits of the interleaved sequences have a greater strategic importance than others, which must be considered as a proof of weakness of interleaved sequence generators regarding their use in cryptography.
This work has been done in the frame of the project HESPERIA (http://www.proyecto-hesperia.org) supported by Centro para el Desarrollo Tecnológico Industrial (CDTI) under programme CENIT and also supported by the companies: Soluziona Consultoría y Tecnología, Unión Fenosa, Tecnobit, Visual-Tools, BrainStorm, SAC and TechnoSafe. The work has also been supported by MEC Project TSI2007-62657.
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
Beth, T., Piper, F.: The Stop-and-Go Generator. In: Proceedings of EUROCRYPT 1984. LNCS, vol. 228, pp. 228–238. Springer, Heidelberg (1985)
Bluetooth, Specifications of the Bluetooth system, Version 1.1 (February 2001), http://www.bluetooth.com/
Caballero-Gil, P., Fúster-Sabater, A.: A Wide Family of Nonlinear Filter Functions with a Large Linear Span. Information Sciences 164, 197–207 (2004)
Caballero-Gil, P., Fúster-Sabater, A.: Using Linear Hybrid Cellular Automata to Attack the Shrinking Generator. IEICE Transactions on Fundamentals of Electronics Communications and Computer E89-A, 1166–1172 (2006)
Coppersmith, D., Krawczyk, H., Mansour, H.: The Shrinking Generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22–39. Springer, Heidelberg (1994)
Fúster-Sabater, A.: Run Distribution in Nonlinear Binary Generators. Applied Mathematics Letters 17, 1427–1432 (2004)
Gollmann, D., Chambers, W.G.: Clock-Controlled Shift Register. IEEE J. Selected Areas Commun. 7, 525–533 (1989)
Golomb, S.: Shift-Register Sequences. Aegean Park Press, Laguna Hill (1982)
Gong, G.: Theory and Applications of q-ary Interleaved Sequences. IEEE Trans. Information Theory 41(2), 400–411 (1995)
GSM, Global Systems for Mobile Communications, http://cryptome.org/gsm-a512.htm
Jennings, S.M.: Multiplexed Sequences: Some Properties. In: Proceedings of EUROCRYPT 1983. LNCS, vol. 149, pp. 210–221. Springer, Heidelberg (1983)
Jiang, S., Dai, Z., Gong, G.: On interleaved sequences over finite fields. Discrete Maths 252, 161–178 (2002)
Kanso, A.: Clock-Controlled Shrinking Generator of Feedback Shift Registers. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 443–451. Springer, Heidelberg (2003)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University Press, Cambridge (1986)
Rivest, R.L.: RSA Data Security, Inc., March 12 (1998)
Shparlinski, I.: On Some Properties of the Shrinking Generator. Designs, Codes and Cryptography 23, 147–156 (2001)
Simpsom, L., Golic, J., Dawson, E.: A Probabilistic Correlation Attack on the Shrinking Generator. In: Boyd, C., Dawson, E. (eds.) ACISP 1998. LNCS, vol. 1438, pp. 147–158. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fúster-Sabater, A., Caballero-Gil, P. (2008). Cryptanalytic Attack on Cryptographic Sequence Generators: The Class of Clock-Controlled Shrinking Generators. In: Gervasi, O., Murgante, B., Laganà, A., Taniar, D., Mun, Y., Gavrilova, M.L. (eds) Computational Science and Its Applications – ICCSA 2008. ICCSA 2008. Lecture Notes in Computer Science, vol 5073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69848-7_54
Download citation
DOI: https://doi.org/10.1007/978-3-540-69848-7_54
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69840-1
Online ISBN: 978-3-540-69848-7
eBook Packages: Computer ScienceComputer Science (R0)