Usage is tricky; as far as I'm aware there are no real uses of cellular automata in the wild. Here Wolfram is using the fact that the future state of a CA is d

Usage is tricky; as far as I'm aware there are no real uses of cellular automata in the wild. Here Wolfram is using the fact that the future state of a CA is difficult to predict or reverse, which is a good property for a cryptographic hash function, but as far as I'm aware, this has not been adopted into any modern cryptosystems. There are a couple of articles that follow up on this, including [1], which seems to indicate that the system is vulnerable to chosen-plaintext attacks. http://jsfiddle.net/yxz4su0r/ http://jsfiddle.net/yxz4su0r/ illustrates the calculation of the 1d cellular automaton that Wolfram discusses in his article. [1] https://dl.acm.org/citation.cfm?id=1025039&CFID=998930375&CFTOKEN=58262102 https://dl.acm.org/citation.cfm?id=1025039&CFID=998930375&CF...