Abstract
An n-cell maximal length cellular automaton (CA) is a binary CA which is having a cycle of length \(2^n-1\). These CAs are linear and have been used in different applications, such as pseudo random number generation, VLSI design & test, cryptosystem etc. For some applications, however, it could be good if we can use non-linear maximal length CAs. In this paper, we arrange an experiment for the search of non-linear maximal length CAs. By experimentation, we have seen that there exists non-linear maximal length CAs.
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
References
Cattel, K., Muzio, J.C.: Synthesis of one dimensional linear hybrid cellular automata. IEEE Trans. CAD 15, 325–335 (1996)
Pal Chaudhuri, P., Roy Chowdhury, D., Nandi, S., Chatterjee, S.: Additive Cellular Automata - Theory and Applications, vol. 1. IEEE Computer Society Press, Los Alamitos (1997). ISBN 0-8186-7717-1
Das, S., Roy Chowdhury, D.: Generating cryptographically suitable non-linear maximum length cellular automata. In: Bandini, S., Manzoni, S., Umeo, H., Vizzari, G. (eds.) ACRI 2010. LNCS, vol. 6350, pp. 241–250. Springer, Heidelberg (2010). https://doi.org/10.1007/978-3-642-15979-4_26
Das, S.: Theory and applications of nonlinear cellular automata in VLSI design. Ph.D. thesis, Bengal Engineering and Science University, Shibpur, India (2007)
Das, S., Kundu, A., Sikdar, B.K.: Nonlinear CA based design of test set generator targeting pseudo-random pattern resistant faults. In: Proceedings of Asian Test Symposium, pp. 196–201 (2004)
Ghosh, S., Sengupta, A., Saha, D., Chowdhury, D.R.: A scalable method for constructing non-linear cellular automata with period \(2^n-1\). In: Wąs, J., Sirakoulis, G.C., Bandini, S. (eds.) ACRI 2014. LNCS, vol. 8751, pp. 65–74. Springer, Cham (2014). https://doi.org/10.1007/978-3-319-11520-7_8
Wolfram, S.: Random sequence generation by cellular automata. Adv. Appl. Math 7, 123 (1984)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Adak, S., Mukherjee, S., Das, S. (2018). Do There Exist Non-linear Maximal Length Cellular Automata? A Study. In: Mauri, G., El Yacoubi, S., Dennunzio, A., Nishinari, K., Manzoni, L. (eds) Cellular Automata. ACRI 2018. Lecture Notes in Computer Science(), vol 11115. Springer, Cham. https://doi.org/10.1007/978-3-319-99813-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-319-99813-8_26
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-99812-1
Online ISBN: 978-3-319-99813-8
eBook Packages: Computer ScienceComputer Science (R0)