Cryptology and generating keys via cellular automata

Cryptology, used to hide a message or data from opponents, has been very vital in our age, since there are lots of important data over electronic platforms and opponents try to seize these data constantly.As the importance of cryptology increases, scientists, especially mathematicians, have studied to develop more secure algorithms and cryptosystems. Eventhough these algorithms are really secure, whenever the key used in these cryptosystems is vulnerable to some attacks, the cipher will not be secure. Therefore, generating a key is especially important.To avoid seizing the ciphertext, the key used must be unpredictible and not be broken. To provide this, several methods have been proposed. Also some tests have been proposed to decide whether these methods satisfy the security.One of these methods which is used for generating a key is a dynamical system, called cellular automata. There are four fundamental classes of cellular automata and the third class which are analogous to chaotic dynamical systems have been used for generating key since they are very sensitive to initial conditions and exhibit random behavior.In this work, generating random keys has been attempted and the generated keys have been tested whether they are secure or not.Besides, the statistical properties of some basic tests for given binary strings have been studied and some of these tests have been tried to adapt to given ternary strings.