05795567

a

05795567 Das, Sourav Roy Chowdhury, Dipanwita Generating cryptographically suitable non-linear maximum length cellular automata. Bandini, Stefania (ed.) et al., Cellular automata. 9th international conference on cellular automata for research and industry, ACRI 2010, Ascoli Piceno, Italy, September 21--24, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15978-7/pbk). Lecture Notes in Computer Science 6350, 241-250 (2010). 2010 Berlin: Springer EN

doi:10.1007/978-3-642-15979-4_26

Summary: 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.