Abstract
A wide family of LFSR-based sequence generators, the so-called Clock-Controlled Shrinking Generators (CCSGs), has been analyzed and identified with a subset of linear cellular automata. In this way, sequence generators conceived and designed as complex nonlinear models can be written in terms of simple linear models. An easy algorithm to compute the pair of one-dimensional linear hybrid cellular automata that generate the CCSG output sequences has been derived. A cryptanalytic approach based on the phaseshift of cellular automata output sequences is sketched too. From the obtained results, we can create linear cellular automata-based models to analyze/cryptanalyze the class of clock-controlled generators.
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
Bao, F.: Crytanalysis of a New Cellular Automata Cryptosystem. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 416–427. Springer, Heidelberg (2003)
Bardell, P.H.: Analysis of Cellular Automata Used as Pseudorandom Pattern Generators. In: Proceedings of the IEEE International Test Conference. Paper 34.1, pp. 762–768 (1990)
Blackburn, S., Murphy, S., Paterson, K.: Comments on Theory and Applications of Cellular Automata in Cryptography. IEEE Transactions on Computers 46, 637–638 (1997)
Cattell, K., Muzio, J.: Analysis of One-Dimensional Linear Hybrid Cellular Automata over GF(q). IEEE Transactions on Computer-Aided Design 45, 782–792 (1996)
Coppersmith, D., Krawczyk, H., Mansour, Y.: The Shrinking Generator. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 22–39. Springer, Heidelberg (1994)
Das, A.K., Ganguly, A., Dasgupta, A., Bhawmik, S., Chaudhuri, P.P.: Efficient Characterisation of Cellular Automata. IEE Proc., Part E 1, 81–87 (1990)
Golomb, S.: Shift-Register Sequences (revised edition). Aegean press, Laguna Hills (1982)
Kanso, A.: Clock-Controlled Shrinking Generators. In: Safavi-Naini, R., Seberry, J. (eds.) ACISP 2003. LNCS, vol. 2727, pp. 443–451. Springer, Heidelberg (2003)
Nandi, S., Kar, B.K., Chaudhuri, P.P.: Theory and Applications of Cellular Automata in Cryptography. IEEE Transactions on Computers 43, 1346–1357 (1994)
Rueppel, R.A.: Stream Ciphers. In: Simmons, G.J. (ed.) Contemporary Cryptology, The Science of Information, pp. 65–134. IEEE Press, Los Alamitos (1992)
Wolfram, S.: Cellular Automata as Models of Complexity. Nature 311, 419 (1984)
Wolfram, S.: Cryptography with Cellular Automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 22–39. Springer, Heidelberg (1986)
Wolfram, S.: Random Sequence generation by Cellular Automata. Advances in Applied Mathematics 7, 123 (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fúster-Sabater, A., de la Guía-Martínez, D. (2004). Cellular Automata Application to the Linearization of Stream Cipher Generators. In: Sloot, P.M.A., Chopard, B., Hoekstra, A.G. (eds) Cellular Automata. ACRI 2004. Lecture Notes in Computer Science, vol 3305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30479-1_63
Download citation
DOI: https://doi.org/10.1007/978-3-540-30479-1_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23596-5
Online ISBN: 978-3-540-30479-1
eBook Packages: Springer Book Archive