2022/11/14 by M. Andrecut, Andrecut, M.
Biochemistry, Genetics and Molecular Biology · Computer Science · Mathematics · #Cellular Automata and Applications #Cryptography and Security (cs.CR) #DNA and Biological Computing #FOS: Computer and information sciences #Stochastic processes and statistical mechanics
paper · pdf · doi:10.48550/arxiv.2211.07626
openalex publication_date 2022/11/14 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We discuss a class of cellular automata (CA) able to produce long random strings, starting from short "seed" strings. The approach uses two principles borrowed from cryptography: diffusion and confusion. We show numerically that the strings are pseudo-random using three approaches based on: Fourier transform, entropy estimation, and compression. An application to cryptography is also included with the corresponding Python code.