CRApr 17
Growing Random Strings in CA
arXiv:2211.0762676.4h-index: 16
AI Analysis
Provides a new method for pseudo-random string generation with potential cryptographic applications.
The paper introduces cellular automata that generate long pseudo-random strings from short seeds using cryptographic principles, validated via Fourier transform, entropy estimation, and compression tests.
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.