Analyse des suites al\'eatoires engendr\'ees par des automates cellulaires et applications \`a la cryptographie

TL;DR

This paper explores the limitations and potential of cellular automata in cryptography, focusing on their pseudo-random sequence generation and discussing new design approaches beyond known correlation-immune rules.

Contribution

It analyzes the constraints of existing cellular automata for cryptographic use and proposes alternative design methods for effective pseudo-random generators.

Findings

Correlation-immune elementary rules do not exist in cellular automata

Existing pseudo-random generators are vulnerable to cryptanalysis

New design approaches for cellular automata are discussed

Abstract

This paper considers interactions between cellular automata and cryptology. It is known that non-linear elementary rule which is correlation-immune don't exist. This results limits the use of cellular automata as pseudo-random generators suitable for cryptographic applications. In addition, for this kind of pseudo-random generators, a successful cryptanalysis was proposed by Meier and Staffelbach. However, other ways to design cellular automata capable to generate good pseudo-random sequences remain and will be discussed in the end of this article.