Abstract
In this work, it is shown that linear Cellular Automata based on rules 90/150 generate all the solutions of linear difference equations with binary constant coefficients. Some of these solutions are binary sequences with application in cryptography. In this sense, we propose CA-based linear models that realize the solutions of difference equations as well as behave as cryptographic keystream generators. Due to the simple transition rules that govern these CA, the implementation of such models is quite easy. Some illustrative examples complete the work.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beth, T., Piper, F.: The Stop-and-Go Generator. In Proc. EUROCRYPT’84. LNCS, vol. 228, pp. 124–132. Springer, Heidelberg (1985)
Bluetooth, Specifications of the Bluetooth system, 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)
Cattell, K., Muzzio, J.C.: Synthesis of One-Dimensional Linear Cellular Automata. IEEE Trans. Computers-Aided Design, 15, 325–335 (1996)
Coppersmith, D., Krawczyk, H., Mansour, A.: The Shrinking Generator. In Proc. ECRYPTO’93. 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.W.: Shift Register-Sequences. Aegean Park Press, Laguna Hill, (1982)
Gong, G.: Theory and Applications of q-ary Interleaved Sequences. IEEE Trans. Information Theory. 41, 400–411 (1995)
GSM, Global Systems for Mobile Communications, available at http://cryptome.org/gsm-a512.htm
Jennings, S.M.: Multiplexed Sequences: Some Properties. In Proc. EUROCRYPT’83. LNCS, vol. 149, Springer, Heidelberg (1983)
Kari, J.: A Survey of Cellular Automata. Theoretical Computer Science. 334, 3–39 (2005)
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)
Wolfram, S.: Random Sequence generation by Cellular Automata. Advances in Applied Mathematics. 123(7) (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Fúster-Sabater, A., Caballero-Gil, P., Delgado, O. (2007). Solving Linear Difference Equations by Means of Cellular Automata. In: Corchado, E., Corchado, J.M., Abraham, A. (eds) Innovations in Hybrid Intelligent Systems. Advances in Soft Computing, vol 44. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74972-1_25
Download citation
DOI: https://doi.org/10.1007/978-3-540-74972-1_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74971-4
Online ISBN: 978-3-540-74972-1
eBook Packages: EngineeringEngineering (R0)