论文标题
在CA中种植随机字符串
Growing Random Strings in CA
论文作者
论文摘要
我们讨论一类细胞自动机（CA）能够产生长的随机字符串，从短“种子”字符串开始。该方法使用了从密码学借来的两个原则：扩散和混乱。我们在数值上使用三种方法基于以下方式显示字符串是伪随机的：傅立叶变换，熵估计和压缩。相应的Python代码还包含了密码学的应用程序。
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.
