Saved in:
Bibliographic Details
Main Author: Andrecut, M.
Format: Preprint
Published: 2022
Subjects:
Online Access:https://arxiv.org/abs/2211.07626
Tags: Add Tag
No Tags, Be the first to tag this record!
Table of Contents:
  • 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.