Cellular automata rules grow short seeds into long pseudo-random strings, validated numerically via Fourier, entropy, and compression tests with a cryptography application and Python code.
Wolfram, Random sequence generation by cellular automata , Advances in applied mathematics, 7(2):123-169 (1986)
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.CR 1years
2022 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Growing Random Strings in CA
Cellular automata rules grow short seeds into long pseudo-random strings, validated numerically via Fourier, entropy, and compression tests with a cryptography application and Python code.