CHAOTIC EXPLORATION OF ONE-DIMENSIONAL CELLULAR AUTOMATA, WITH APPLICATIONS FOR CRYPTOGRAPHY

摘要

We propose an extremely simple and explicit construction of cellular automata (CA) generating pseudorandom sequences, using chaotic exploration of the CA's space to produce the desired key stream. This construction has advantages over the previous researches in the following points: (1) the bits selection process is more complicated and randomized due to the chaotic nature of the used maps, which make existing cryptanalysis methods fail to construct the initial key; (2) the derivation of the chaotic maps initial conditions enhance the sensitivity of the key to small variations and lead to a more robust ciphering. The statistical nature of the cryptosystem is analyzed using multiples test suites, and compared to those of existing standards such like DES, 3DES and AES. Obtained results show that generated cipher-stream has random like properties and pass with success all DIHARD suite testes.