Abstract
Non-linearity as well as randomness are essential for cryptographic applications. The Linear Cellular Automata (CA), particularly maximum length CA, are well known for generating excellent random sequences. However, till date, adequate research has not been done to generate maximal length Cellular Automata using non-linear rules; a fact that limits the application of CA in cryptography. This paper devices a method to generate non-linear Maximal Length Cellular Automata. It manipulates the number of clock cycles, based on inputs, in a maximum length additive CA and generates a series of non-linear boolean mappings. It shows that the bit streams generated in this manner are highly non-linear and pass all the statistical tests for randomness. These maximum length CA can be used as a non-linear primitive in cryptographic applications.
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
Chaudhury, P.P., Chowdhury, D.R., Nandi, S., Chattopadhay, S.: Additive Cellular Automata Theory and Application, vol. 1. IEEE Computer Society Press, Los Alamitos
NIST Statistical Test Suit, http://csrc.nist.gov/rng/
Serra, M., Slater, T., Muzio, J.C., Miller, D.M.: Analysis of One Dimensional Cellular Automata and their Aliasing Probabilities. IEEE Trans. on CAD 9(7), 767–778 (1990)
Tomassini, M., Sipper, M., Perrenoud, M.: On the Generation of High-Quality Random Numbers by Two-dimensional Cellular Automata. IEEE Trans. on Computers 49(10), 1146–1151 (2000)
Nandi, S., et al.: Analysis of Periodic and Intermediate Boundary 90/150 Cellular Automata. IEEE Trans. on Computers 45(1), 1–12 (1996)
Hortencius, P.D., McLeod, R.D., Pries, W., Miller, D.M., Card, H.C.: Cellular Automata based Pseudo-random Number Generators for Built-in Self-Test. IEEE Trans. on CAD 8(8), 842–859 (1989)
Wolfram, S.: A New Kind of Science. Wolfram Media, Champaign (2002)
Chabaud, F., Vaudenay, S.: Links between differential and linear cryptanalysis. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 356–365. Springer, Heidelberg (1995)
Cattell, K., Zhang, S.: Minimal Cost One-Dimensional Linear Hybrid Cellular Automata of Degree Through 500. Journal Of Electronic Testing: Theory and Applications 6, 255–258 (1995)
Wolfram, S.: Random Sequence Generation by Cellular Automata. Advances in Applied Mathematics 7, 123 (1986)
Wolfram, S.: Cryptography with Cellular Automata. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 429–432. Springer, Heidelberg (1986)
Meier, W., Staffelbach, O.: Anaysis of Pseudo Random Sequences Generated by Cellular Automata. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 186–199. Springer, Heidelberg (1991)
Nyberg, K.: On the construction of highly nonlinear permutations. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 92–98. Springer, Heidelberg (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Das, S., Roy Chowdhury, D. (2010). Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata . In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds) Cellular Automata. ACRI 2010. Lecture Notes in Computer Science, vol 6350. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-15979-4_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-15979-4_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-15978-7
Online ISBN: 978-3-642-15979-4
eBook Packages: Computer ScienceComputer Science (R0)