Linear Cellular Automata as Discrete Models for Generating Cryptographic Sequences

TL;DR

This paper introduces a cellular automata-based linear model capable of generating cryptographic sequences and solutions to linear difference equations, offering a simple yet effective approach for pseudorandom number generation in cryptography.

Contribution

It presents a novel cellular automata model that efficiently produces cryptographic sequences and solutions to linear difference equations, enhancing pseudorandom number generation methods.

Findings

The model generates solutions to linear binary difference equations.

It produces cryptographic keystream sequences with pseudorandom properties.

The approach is simple, based on concatenations of a basic linear automaton.

Abstract

In this paper, we develop a new cellular automata-based linear model for several nonlinear pseudorandom number generators with practical applications in symmetric cryptography. Such a model generates all the solutions of linear binary difference equations as well as many of these solutions are pseudo-random keystream sequences. In this way, a linear structure based on cellular automata may be used to generate not only difference equation solutions but also cryptographic sequences. The proposed model is very simple since it is based exclusively on successive concatenations of a basic linear automaton.