If
in the original sequence there exists a 00, then the next
sequence will have a 1.
If in the original sequence there exists a 01, then the next
sequence will have a 0.
If in the original sequence there exists a 10, then the next
sequence will have a 1.
If in the original sequence there exists a 11, then the next
sequence will have a 0.
Cellular Automata behave by the rules of Chaos Theory. They
are not truly random, for they repeat in a deterministic pattern.
But the pattern is so complicated that to attempt to describe
it mathematically would result in an equation more complex
than the pattern itself. This chaotic behavior allows cellular
automata to be used in encryption. There is no way to devise
an efficient mathematical routine for use in cracking data
that was encrypted for cellular automata.
Automata
as data carriers, as eluded to in the previous paragraph,
are quite efficient, for they create patterns of equilateral
triangles. The sizes of these equilateral triangles depend
on the initial random formation of the first binary sequence.
Therefore, intelligent planned creation of the initial sequence
would lead to strategically sized triangles, and therefore
ways to store data. Also, because automata are binary sequences,
the triangles could be created out of either 0s or 1s. Therefore,
an additional permutation set could be created by strategically
setting whether each triangle is created from 0s or 1s.
For business encryption, though,
automata would work more like the German Enigma machine -
simply taking an ASCII sequence, translating it into cellular
automata to encrypt, and then translating it back into ASCII
to decrypt. The precise algorithm is secret, known only to
Phaedo members.
