Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata

@inproceedings{Das2010GeneratingCS,
  title={Generating Cryptographically Suitable Non-linear Maximum Length Cellular Automata},
  author={Sourav Das and Dipanwita Roy Chowdhury},
  booktitle={ACRI},
  year={2010}
}
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… CONTINUE READING