Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?

@inproceedings{Applebaum2010CryptographyBC,
  title={Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature?},
  author={Benny Applebaum and Yuval Ishai and Eyal Kushilevitz},
  booktitle={ICS},
  year={2010}
}
Computation in the physical world is restricted by the following spatial locality constraint: In a single unit of time, information can only travel a bounded distance in space. A simple computational model which captures this constraint is a cellular automaton: A discrete dynamical system in which cells are placed on a grid and the state of each cell is updated via a local deterministic rule that depends only on the few cells within its close neighborhood. Cellular automata are commonly used to… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS