Growing Random Strings in CA

11/14/2022
by   M. Andrecut, et al.
0

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.

READ FULL TEXT

page 3

page 5

research
09/30/2022

Strings And Colorings Of Topological Coding Towards Asymmetric Topology Cryptography

We, for anti-quantum computing, will discuss various number-based string...
research
06/06/2018

Binary linear code weight distribution estimation by random bit stream compression

A statistical estimation algorithm of the weight distribution of a linea...
research
06/09/2023

Pseudorandom Strings from Pseudorandom Quantum States

A fundamental result in classical cryptography is that pseudorandom gene...
research
03/23/2023

Equational Theorem Proving for Clauses over Strings

Although reasoning about equations over strings has been extensively stu...
research
05/21/2019

Sampling from Stochastic Finite Automata with Applications to CTC Decoding

Stochastic finite automata arise naturally in many language and speech p...
research
11/06/2018

Tunneling on Wheeler Graphs

The Burrows-Wheeler Transform (BWT) is an important technique both in da...
research
09/07/2020

A Fast Randomized Algorithm for Finding the Maximal Common Subsequences

Finding the common subsequences of L multiple strings has many applicati...

Please sign up or login with your details

Forgot password? Click here to reset