Generating cryptographically suitable non-linear maximum length cellular automata

Authors:
Sourav Das;Dipanwita Roy Chowdhury
Affiliations:
Dept. of CSE, Indian Institute of Technology, Kharagpur, India and Alcatel-Lucent India Limited, Bangalore, India;Dept. of CSE, Indian Institute of Technology, Kharagpur, India
Venue:
ACRI'10 Proceedings of the 9th international conference on Cellular automata for research and industry
Year:
2010

Citing 8
Cited 0

Random sequence generation by cellular automata

Advances in Applied Mathematics
Cryptography with cellular automata

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Minimal cost one-dimensional linear hybrid cellular automata of degree through 500

Journal of Electronic Testing: Theory and Applications
Analysis of Periodic and Intermediate Boundary 90/150 Cellular Automata

IEEE Transactions on Computers
On the Generation of High-Quality Random Numbers by Two-Dimensional Cellular Automata

IEEE Transactions on Computers
A new kind of science

A new kind of science
Analysis of pseudo random sequences generated by cellular automata

EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
On the construction of highly nonlinear permutations

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

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.